#include <fstream>
#include <ctime>
#include <cstdlib>
#define maxn 500001

using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");

int v[maxn],n;

//Partition2

void quicksort (int p, int q)
{
    if (q<=p) return;

    int x=rand()%(q-p+1)+p;
    swap (v[x],v[p]);
    int piv = p, i = p, j = q;

    while (i < j)
    {

        while (j > piv && v[j] >= v[piv])
            --j;
        if (j > piv)
        {
            swap (v[piv],v[j]);
            piv = j;
        }

        while (i < piv && v[i] <= v[piv])
            ++i;
        if (i < piv)
        {
            swap (v[piv],v[i]);
            piv = i;
        }

    }

    quicksort (p,j-1);
    quicksort (j+1,q);
}

int main()
{
    fin>>n;
    for (int i=1; i<=n; ++i) fin>>v[i];

    srand (time(NULL));
    quicksort (1,n);

    for (int i=1; i<=n; ++i) fout<<v[i]<<" ";
}