#include<fstream.h>

void merge(int a[],int li,int m,int ls)
{
int i,j,k,b[500005];
for(i=li;i<=ls;i++)b[i]=a[i];
i=li;
k=li;
j=m+1;
while(i<=m && j<=ls)
     if(b[i]<b[j])a[k++]=b[i++];
     else a[k++]=b[j++];
while(i<=m)a[k++]=b[i++];
while(j<=ls)a[k++]=b[j++];
}

void mergesort(int a[],int li,int ls)
{
if(li==ls)return;
int m=(li+ls)/2;
mergesort(a,li,m);
mergesort(a,m+1,ls);
merge(a,li,m,ls);
}


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