#include <iostream>
#include <fstream>

using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

int a[50001],b[50001],n;

void interclasare(int i,int m,int j)
{ int x=i;
 int k=1;
 int y=m+1;
 while(x<=m && y<=j)
     if (a[x]<a[y])
           b[k++]=a[x++];
     else
           b[k++]=a[y++];

 while (x<=m)
        b[k++]=a[x++];
 while (y<=j)
        b[k++]=a[y++];

 int t=i;
 for (k=1;k<=(j-i)+1;k++)
        a[t++]=b[k];
}

void merge(int i, int j,int a[50001])
{
    int p=j;
    if (i<j)
    {
        int m=(i+j)/2;
        merge(i,m,a);
        merge(m+1,j,a);
        interclasare(i,m,j);
    }
}


int main()
{
   f>>n;
   int i;
    for(i=1;i<=n;i++)
            f>>a[i];
   merge(1,n,a);
   for(i=1;i<=n;i++)
      g<<a[i]<<' ';
}