#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int aux[500001], n;
void inter(int v[], int st, int dr)
{
    int m=(st+dr)/2, i=st, j=m+1, k=st;
    while(i <= m && j <= dr)
    {
        if(v[i] <= v[j])
        {
            aux[k++]=v[i++];
        }
        else
        aux[k++]=v[j++];
    }
    while(i<=m)
    aux[k++]=v[i++];
    while(j<=dr)
    aux[k++]=v[j++];
    for(int t=st; t <= dr; t++)
    {
        v[t]=aux[t];
    }
}
void merg(int v[], int st, int dr)
{
    if(st!=dr)
    {
        int m=(st+dr)/2;
        merg(v, st, m);
        merg(v, m+1, dr);
        inter(v, st, dr);
    }
}
int main()
{
    int v[500001];
    in >> n;
    for(int i=1; i <= n; i++)
    {
        in >> v[i];
    }
    merg(v, 1, n);
    for(int i=1; i <= n; i++)
    {
        out << v[i] << " ";
    }
    return 0;
}