#include <fstream>
#include <vector>

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, z;
    int q = a[a.size() / 2], y = 0;

    for (int i = 0; i < a.size(); i++)
    {
        if (a[i] == q) y++;
        if (a[i] > q) z.push_back(a[i]);
        if (a[i] < q) x.push_back(a[i]);
    }
    a.clear();

    qs(x);
    qs(z);

    a = x;
    for (int i = 0; i < y; i++)
        a.push_back(q);
    for (int i = 0; i < z.size(); i++)
        a.push_back(z[i]);
}*/

void qs(vector <int> &a, int left, int right)
{
    int i = left, j = right, q = a[(i + j) / 2];

    while (i < j)
    {
        while (a[i] < q) i++;
        while (a[j] > q) j--;
        if (i <= j)
        {
            swap(a[i], a[j]);
            i++; j--;
        }
    }

    if (i < right) qs(a, i, right);
    if (left < j) qs(a, left, j);
}

int main()
{
    read();

    qs(0, a.size() - 1);

    write();

    return 0;
}