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

using namespace std;

vector <int> a;

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

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

    cout.close();
}

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

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

    cin.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);

    for (int i = 0; i < y.size(); i++)
        x.push_back(y[i]);

    a.resize(x.size() + z.size());
    merge(x.begin(), x.end(), z.begin(), z.end(), a.begin());
}

int main()
{
    read();

    qs(a);

    write();

    return 0;
}