#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[500400], n;
void citire()
{
    int i;
    f>>n;
    for(i=1;i<=n;++i)
        f>>v[i];
    f.close();
}
void afisare()
{
    int i;
    for(i=1;i<=n;++i)
        g<<v[i]<<" ";
    g<<endl;
    g.close();
}
int hoare(int v[], int p, int r)
{
    int pivot = v[(p+r)/2];
    int i = p - 1, j = r + 1;
    while (true)
    {
        do
        {
            i++;
        } while (v[i] < pivot);
        do
        {
            j--;
        } while (v[j] > pivot);
        if (i >= j)
            return j;

        swap(v[i], v[j]);
    }
}

void quickSort(int v[], int p, int r)
{
    if (p < r)
    {
        int q = hoare(v, p, r);
        quickSort(v, p, q);
        quickSort(v, q + 1, r);
    }
}
int main()
{
    citire();
    quickSort(v,1, n);
    afisare();
}