#include <cstdio>
#include <algorithm>
#include <ctime>

using namespace std;

int v[500010],v1[500010];

int random(int x,int y)
{
    return x+(1LL*rand()*rand())%(y-x+1);
}

void mergesort(int st,int dr)
{
    if(st>=dr) return;
    int mid=(st+dr)/2;
    mergesort(st,mid);
    mergesort(mid+1,dr);
    int x=st,y=mid+1,nr=0;
    while(x<=mid || y<=dr)
        if(x<=mid && y<=dr)
        {
            if(v[x]<v[y]) v1[++nr]=v[x++];
            else v1[++nr]=v[y++];
        }
        else if(x<=mid) v1[++nr]=v[x++];
        else if(y<=dr) v1[++nr]=v[y++];
    for(int i=1;i<=nr;i++) v[st+i-1]=v1[i];
}

int main()
{
    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);
    srand(time(0));
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&v[i]);
    mergesort(1,n);
    for(int i=1;i<=n;i++) printf("%d ",v[i]);
    return 0;
}