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

using namespace std;

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

int v[maxn],n;

//Hoare

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

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

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

    quicksort (p,j);
    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]<<" ";
}