#include<fstream>
using namespace std;
int a[500002],n,i;
void merge(int low,int mid,int high)
{int h,i,j,b[250001],k;
 h=low;
 i=low;
 j=mid+1;
 while((h<=mid)&&(j<=high))
 {if(a[h]<=a[j])
  {b[i]=a[h];
   h++;}
  else
  {b[i]=a[j];
   j++;}
  i++;}
 if(h>mid)
 {for(k=j;k<=high;k++)
  {b[i]=a[k];
   i++;}}
 else
 {for(k=h;k<=mid;k++)
  {b[i]=a[k];
   i++;}}
 for(k=low;k<=high;k++) a[k]=b[k];}
void merge_sort(int low,int high)
{int mid;
 if(low<high)
 {mid=(low+high)/2;
  merge_sort(low,mid);
  merge_sort(mid+1,high);
  merge(low,mid,high);}}
 main()
{ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
 for(i=1;i<=n;i++)
 {f>>a[i];}
f.close();
merge_sort(1,n);
 for(i=1;i<=n;i++)
 g<<a[i]<<" ";}