#include<iostream>
#include<cmath>
using namespace std;
int A[100010];voidquickSort(int left,int right){
int i=left,j=right,mid=A[(left+right)/2];if(left>=right)return;while(i<=j){while(A[j]>mid) j--;while(A[i]<mid) i++;if(i<=j){swap(A[i],A[j]);
i++; j--;}}quickSort(left,j);quickSort(i,right);}
int main(){
int n;cin>>n;for(int i=1;i<=n;i++) cin>>A[i];quickSort(1,n);for(int i=1;i<=n;i++) cout<<A[i]<<" ";
cout<<endl;return0;}