#include <fstream>
#include <cstdlib>
#include <ctime>

using namespace std;

const int N = 5e5;

int v[N];

/*
int part(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 = part(v, st, dr);
    if (st < p)
    {
        qs(v, st, p - 1);
    }
    if (p < dr)
    {
        qs(v, p + 1, dr);
    }
}
*/

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

void qs3p(int v[], int st, int dr)
{
    if (st == dr)
    {
        return;
    }
    int p1, p2;
    part3w(v, st, dr, p1, p2);
    if (st < p1)
    {
        qs3p(v, st, p1 - 1);
    }
    if (p2 < dr)
    {
        qs3p(v, p2 + 1, dr);
    }
}

void shuffle(int v[], int n)
{
    srand(time(NULL));
    ///face ca la fiecare rulare sa fie amestecate altfel
    for (int i = n - 1; i > 0; i--)
    {
        int p = rand() % (i + 1);
        swap(v[i], v[p]);
    }
}

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);
    qs3p(v, 0, n - 1);
    for (int i = 0; i < n; i++)
    {
        out << v[i] << " ";
    }
    in.close();
    out.close();
    return 0;
}