#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int v[500011],ve[500011],n,i,j,k,m;

void ms(int v[],int st,int mij, int dr)
{
    int k=0,i=st,j=mij+1;
    while (i<=mij && j<=dr)
    {
        if (v[i]<v[j]) ve[++k]=v[i],i++;else
                    ve[++k]=v[j],j++;
    }
    if (i<=mij) for (i;i<=mij;i++) ve[++k]=v[i];else
        for (j;j<=dr;j++) ve[++k]=v[j];
    for (i=st;i<=dr;i++) v[i]=ve[i-st+1];
}

void mmerge(int v[],int st,int dr)
{
    if (st == dr) return;
    int mij = (st+dr)/2;
    mmerge(v,st,mij);
    mmerge(v,mij+1,dr);
    ms(v,st,mij,dr);
}

int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);

    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d",&v[i]);

    mmerge(v,1,n);

    for (i=1;i<=n;i++)
        printf("%d ",v[i]);

    return 0;
}