#include <fstream>

using namespace std;

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

const int max_size = 5e5 + 1;

int v[max_size], aux[max_size];

void interclasare (int v[], int st, int dr)
{
    int m = (st + dr) / 2;
    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[max_size], int st, int dr)
{
    if (st == dr)
    {
        return;
    }
    int 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] << " ";
    }
    in.close();
    out.close();
    return 0;
}