#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <algorithm>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int x[500002],n,i;

 int part(int p, int u)
 {
    int piv = x[rand() % (u-p+1) + p];

    while (1){
        while(x[p] < piv) p++;
        while(x[u] > piv) u--;
if(p+1 > u-1)
            return p ;
        else
            swap(x[p++], x[u--]);




    }
    return p;}


void quick(int p,int u)
{int k;
 if (p<u) {k=part(p,u);
                quick(p,k);
                quick(k+1,u);}
}


int main()
{srand(time(0));
f>>n;
for(int i=1;i<=n;i++)
             {
             f>>x[i];
             }
quick(1,n);
for(i=1;i<=n;i++)
  g<<x[i]<<' ';

}