#include <fstream>
#include <cstdlib>

using namespace std;

const int N = 500000;

int v[N];

/*
int part_2(int v[], int st, int dr)
{
    int lim = st;
    for (int i = st; i < dr; i++)
    {
        if (v[i] <= v[dr])
        {
            swap(v[lim++], v[i]);
        }
    }
    swap(v[lim], v[dr]);
    return lim;
}
*/

void part_3(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 ///v[i] == v[dr]
        {
            i++;
        }
    }
    swap(v[dr], v[++p2]);
}

void quick_sort(int v[], int st, int dr)
{
    if (st >= dr)
    {
        return;
    }
    //int p = part_2(v, st, dr);
    int p1, p2;
    part_3(v, st, dr, p1, p2);
    quick_sort(v, st, p1 - 1);
    quick_sort(v, p2 + 1, dr);
}

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