//Merge Sort
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int v[500005],V[500005],n,i,j,k,m;

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

void Merge(int v[],int st,int dr)
{
    if (st == dr) return;
    int mij = (st+dr)/2;
    Merge(v,st,mij);
    Merge(v,mij+1,dr);
    Mergesort(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]);
    Merge(v,1,n);
    for (i=1;i<=n;i++)
        printf("%d ",v[i]);
    return 0;
}