#include <fstream>
#include<algorithm>
using namespace std;
int i,n,a[500010];
int cmp(int a,int b)
{
    if(a>b)return 0;
    else return 1;
}
void merge(int,int,int);
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);
 }
}
void merge(int low,int mid,int high)
{
 int h,i,j,b[500010],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];
}
int main()
{
    //freopen("algsort.in","r",stdin);
    //freopen("algsort.out","w",stdout);
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    f>>n;
    for(i=1;i<=n;i++)
    f>>a[i];
    merge_sort(1,n);
   // sort(a+1,a+1+n,cmp);
    for(i=1;i<=n;i++)
    g<<a[i]<<' ';
    //printf("%d ",a[i]);
    return 0;
}