#include <fstream>
#include <stdlib.h>
using namespace std;

ifstream in("algsort.in");
ofstream out("algsort.out");

int v[500001];

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[p++], v[i]);
    }
    swap(v[p], v[dr]);
    return p;
}

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

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

int main()
{
    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] << " ";
    return 0;
}