#include <cstdio>
#include <algorithm>

using namespace std;

int v[500010],v1[500010];

void merge_sort(int st,int dr)
{
    if(st>=dr) return;
    int mid=(st+dr)/2;
    merge_sort(st,mid);
    merge_sort(mid+1,dr);
    merge(v+st,v+mid+1,v+mid+1,v+dr+1,v1);
    for(int i=st;i<=dr;i++) v[i]=v1[i-st];
}

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