#include<bits/stdc++.h>
using namespace std;
int a[100001];
void quicksort(int left,int right){
if(left>right) return;
int i=left,j=right;
while(i<j){
while(a[j]>=a[left]&&j>i) j--;
while(a[i]<=a[left]&&j>i) i++;
swap(a[j],a[i]);
}
swap(a[left],a[i]);
quicksort(left,i-1);
quicksort(i+1,right);
}
int main(){
int n;cin>>n;
for(int i=0;i<n;i++)scanf("%d",&a[i]);
quicksort(0,n-1);
for(int i=0;i<n;i++)printf("%d ",a[i]);
return 0;
}