#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);
    merge(v+st,v+mid+1,v+mid+1,v+dr+1,v1);
    for(int i=0;i<dr-st+1;i++) v[st+i]=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;
}