#include <iostream>
#include <fstream>
using namespace std;

ifstream in("algsort.in");
ofstream out("algsort.out");

const int N = 500000;
int aux[N] , v[N] , n, m;
void interclasare (int v[], int st, int dr)
{
    int 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(k = st ; k <= dr ; k++)
    {
        v[k] = aux[k];
    }
}

void ms (int v[], int st, int dr)
{
    if (st == dr)
    {
        return;
    }
     m = (st+dr)/2;
    ms(v, st, m);
    ms(v, m + 1, dr);

    interclasare (v, st, dr);
}
int main()
{
    int n;
    in >> n;
    for (int i = 1 ; i <= n ; i++)
    {
        in >> v[i];
    }

    ms(v, 1 , n);

    for (int i = 1 ; i <= n ; i++)
    {
        out << v[i] << " ";
    }

    return 0;
}