#include <bits/stdc++.h>

using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,v[500010],w[500010];
void merge_sort(int,int);
int main()
{
    f>>n;
    for(int i=1;i<=n;i++)
        f>>v[i];
    merge_sort(1,n);
    for(int i=1;i<=n;i++)
        g<<v[i]<<' ';
    return 0;
}
void merge_sort(int lo,int hi)
{
    if(lo==hi)return;
    int mi=(lo+hi)/2,i,j,k;
    merge_sort(lo,mi);
    merge_sort(mi+1,hi);
    for(i=lo;i<=hi;i++)
        w[i]=v[i];
    i=lo;k=lo,j=mi+1;
    while(i<=mi&&j<=hi)
    {
        if(w[i]<=w[j])
            v[k++]=w[i++];
        else
            v[k++]=w[j++];
    }
    while(i<=mi)v[k++]=w[i++];
    while(j<=hi)v[k++]=w[j++];
}