#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

vector <int> a;

void write()
{
    ofstream f("algsort.out");

    for (int i = 0; i < a.size(); i++)
        f << a[i] << ' ';
    f << '\n';

    f.close();
}

void read()
{
    int n;
    ifstream f("algsort.in");
    f >> n;
    a.resize(n);

    for (int i = 0; i < a.size(); i++)
        f >> a[i];

    f.close();
}

void qs(vector <int> &a)
{
    if (a.size() < 2) return;
    vector <int> x, y, z;
    int q = a[a.size() / 2];

    for (; !a.empty(); )
    {
        int last = a[a.size() - 1];
        if (last == q) y.push_back(last), a.pop_back();
        if (last > q) z.push_back(last), a.pop_back();
        if (last < q) x.push_back(last), a.pop_back();
    }

    qs(x);
    qs(z);

    merge(x.begin(), x.end(), y.begin(), y.end(), a.begin());
    for (int i = 0; i < z.size(); i++)
        a.push_back(z[i]);
}

int main()
{
    read();

    qs(a);

    write();

    return 0;
}