#include <fstream>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
const int nmax = 5e5 + 1;
int v[nmax] , ans[nmax] , n;
void srt(int st , int dr)
{
    if(st == dr)
    {
        ans[st] = v[st];
    }
    else
    {
        int mij = (st+dr)/2;
        srt(st,mij);
        srt(mij+1,dr);
        for(int i = st ; i <= dr ; ++i) v[i] = ans[i];
        int i = st , j = mij + 1 , ind = st;
        while(i <= mij && j <= dr)
        {
            if(v[i] < v[j])
            {
                ans[ind++] = v[i++];
            }
            else ans[ind++] = v[j++];
        }
        while(i <= mij) ans[ind++] = v[i++];
        while(j <= dr) ans[ind++] = v[j++];
    }
}
int main()
{
    cin >> n;
    for(int i = 1 ; i <= n ; ++i)
    {
        cin >> v[i];
    }
    srt(1,n);
    for(int i = 1 ; i <= n ; ++i) cout << ans[i] << ' ';
    return 0;
}