#include<stdio.h>
#define N 500000
int v[N],n,y[N],i;
void M(int p,int q)
{
    int m=(p+q)>>1,i,j,k;
    if(p==q)
        return;
    M(p,m),M(m+1,q);
    for(k=i=p,j=m+1;i<=m||j<=q;)
        if(j>q||(i<=m&&v[i]<v[j]))
            y[k++]=v[i++];
        else
            y[k++]=v[j++];
    for(i=p;i<=q;i++)
        v[i]=y[i];
}
int main()
{
    freopen("algsort.in","r",stdin),freopen("algsort.out","w",stdout),scanf("%d",&n);
    for(i=0;i<n;i++)
        scanf("%d",v+i);
    for(M(0,n-1),i=0;i<n;i++)
        printf("%d ",v[i]);
    return 0;
}