#include <fstream>

using namespace std;

#define N 500000

int v[N+1];

void quicks(int beg, int en){
    int b, e, piv, aux;

    b = beg;
    e = en;
    piv = v[(b + e) / 2];

    while (v[b] < piv)
        b++;

    while (v[e] > piv)
        e--;

    while (b < e){
        swap (v[b], v[e]);

        do
            b++;
        while (v[b] < piv);

        do
            e--;
        while (v[e] > piv);
    }

    if (beg < e)
        quicks(beg, e);

    if (e + 1 < en)
        quicks(e + 1, en);
}

int main()
{
    ifstream cin ("algsort.in");
    ofstream cout ("algsort.out");

    int n, i;

    cin >> n;

    for (i=1; i<=n; i++)
        cin >> v[i];

    quicks(1, n);
    for (i=1; i<=n; i++)
        cout << v[i] << ' ';
    return 0;
}