#include <fstream>
using namespace std;
int a[500001],b[500001],i,n;
void intercls(int st, int mij, int dr){
    int i,j,t,k;
    for (i=st;i<=dr;i++)b[i]=a[i];
    i=st;j=mij+1;k=st-1;
    while(i<=mij&&j<=dr){
        if (b[i]<=b[j]){a[++k]=b[i];i++;}
        else {a[++k]=b[j];j++;}
    }
    for (t=i;t<=mij;t++)a[++k]=b[t];
    for (t=j;t<=dr;t++)a[++k]=b[t];}

void mergesort(int st, int dr){
int mij;if (st!=dr)
{mij=(st+dr)/2;
    mergesort(st,mij);
    mergesort(mij+1,dr);
    intercls(st, mij, dr);

}
}
int main()
{ifstream f("algsort.in");
ofstream g("algsort.out");
    f>>n;
for (i=1;i<=n;i++)f>>a[i];
mergesort(1,n);
for (i=1;i<=n;i++)g<<a[i]<<" ";
    return 0;
}