#include <fstream>

using namespace std;

const int N = 1e5;

int v[N], aux[N];

int part_2(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_2(v, st, dr);
    quick_sort(v, st, p - 1);
    quick_sort(v, p + 1, dr);
}

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