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

using namespace std;

const int N = 5e5;

int n, v[N];

void part3(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[++p2], v[dr]);
}

void qs(int v[], int st, int dr)
{
    if (st >= dr)
    {
        return;
    }
    int p1, p2;
    part3(v, st, dr, p1, p2);///separa secv. in < pivot (de la st la p1-1)
    ///= pivot (de la p1 la p2) si > pivotul (de la p2+1 la dr)
    qs(v, st, p1 - 1);///ordonez elem. < pivotul
    qs(v, p2 + 1, dr);///ordonez elem. > pivotul
}

int main()
{
    ifstream in("algsort.in");
    ofstream out("algsort.out");
    ///citire
    in >> n;
    for (int i = 0; i < n; i++)
    {
        in >> v[i];
    }
    ///shuffle
    srand(time(NULL));///reseteaza "randomizarea"
    for (int  i = n - 1; i > 0; i--)
    {
        int p = rand() % (i + 1);
        swap(v[i], v[p]);
    }
    qs(v, 0, n - 1);
    for (int i = 0; i < n; i++)
    {
        out << v[i] << " ";
    }
    in.close();
    out.close();
    return 0;
}