#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>

using namespace std;

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

const int NMAX = 5e5;

int v[NMAX + 1];

void part3(int v[], int st, int dr, int& p1, int& p2) {

    p1 = st;
    p2 = dr - 1;

    int i = st;

    while (i <= p2) {
        if (v[i] < v[dr]) {
            swap(v[i++], v[p1++]);
        }
        else if (v[i] > v[dr]) {
            swap(v[i], v[p2--]);
        }
        else {
            i++;
        }
    }

    swap(v[++p2], v[dr]);

}

void qs(int v[], int st, int dr) {

    if (st >= dr) {
        return;
    }

    int p1, p2;

    part3(v, st, dr, p1, p2);
    qs(v, st, p1 - 1);
    qs(v, p2 + 1, dr);

}

int main()
{
    int n;
    fin >> n;

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

    srand(time(NULL));
    for (int i = n; i >= 1; i--)
    {
        int p = rand() % (i + 1);
        swap(v[i], v[p]);
    }

    qs(v, 1, n);

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

    return 0;
}