#include <iostream>
#include <stdio.h>

using namespace std;

const int NMAX = 500005;

int partitie(int v[], int st, int dr) {
    int p = st;
    for (int i = st; i < dr; i++)
        if (v[i] <= v[dr])
            swap(v[i], v[p++]);
    swap(v[p], v[dr]);
    return p;
}

void qs(int v[], int st, int dr) {
    if (st >= dr)
        return;
    int p = partitie(v, st, dr);
    qs(v, st, p - 1);
    qs(v, p + 1, dr);
}

void partitie3(int v[], int st, int dr, int &p1, int &p2) {
    p1 = st;
    p2 = dr - 1;
    for (int i = st; 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[dr], v[++p2]);
}
void qs3(int v[], int st, int dr) {
    if (st >= dr)
        return;
    int p1, p2;
    partitie3(v, st, dr, p1, p2);
    qs(v, st, p1 - 1);
    qs(v, p2 + 1, dr);
}

int main() {

    freopen ("algsort.in", "r", stdin);
    freopen ("algsort.out", "w", stdout);

    int n, i, p, v[NMAX];
    scanf ("%d", &n);
    for (i = 1; i <= n; i++)
        scanf ("%d", &v[i]);
    for (i = n; i > 0; i--) {
        p = rand() % i + 1;
        swap(v[i], v[p]);
    }
    qs3(v, 1, n);

    for (i = 1; i <= n; i++)
        printf ("%d ", v[i]);

    return 0;
}