#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,i,v[500010],w[500010];
void sorteaza(int st, int dr), interclaseaza(int st, int mid, int dr);
int main() {
    fin>>n;
    for (i=1;i<=n;i++)
        fin>>v[i];
    sorteaza(1,n);
    for (i=1;i<=n;i++)
        fout<<v[i]<<" ";
    return 0;
}
void interclaseaza(int st, int mid, int dr) {
    int i=st, j=mid+1, k=st-1;
    while (i<=mid&&j<=dr) {
        if (v[i]<v[j])
            w[++k]=v[i++];
        else
            w[++k]=v[j++];
    }
    for (;i<=mid;i++)
        w[++k]=v[i];
    for (;j<=dr;j++)
        w[++k]=v[j];
    for (i=st;i<=dr;i++)
        v[i]=w[i];
}
void sorteaza(int st, int dr) {
    if (st<dr) {
        int mid=(st+dr)/2;
        sorteaza(st,mid);
        sorteaza(mid+1,dr);
        interclaseaza(st,mid,dr);
    }
}