#include <fstream>
#include <cstdlib>

using namespace std;

const int N = 5e5;

int v[N];

int part2(int v[], int st, int dr)
{
    //int poz_p = rand() % (dr - st + 1) + st;
    //swap(v[poz_p], v[dr]);
    int p = st;
    for (int i = st; i < dr; i++)
    {
        if (v[i] <= v[dr])
        {
            swap(v[p++], v[i]);
        }
    }
    swap(v[p], v[dr]);
    return p;
}

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]);
            i++;
        }
        else if (v[i] > v[dr])
        {
            swap(v[i], v[p2]);
            p2--;
        }
        else///v[i] == v[dr]
        {
            i++;
        }
    }
    ++p2;///p2 devine pozitia primului "verde"
    swap(v[dr], v[p2]);
}

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);
}

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

int main()
{
    ifstream in("algsort.in");
    ofstream out("algsort.out");
    int n;
    in >> n;
    for (int i = 0; i < n; i++)
    {
        in >> v[i];
    }
    shuffle(v, n);
    qs(v, 0, n - 1);
    for (int i = 0; i < n; i++)
    {
        out << v[i] << " ";
    }
    in.close();
    out.close();
    return 0;
}