#include <iostream>
#include <time.h>
#include <fstream>

using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

int n,v[500001];

void quicksort(int st,int dr)
{
    if(st>=dr) return;

    int k,l,p,pivot;
    k = rand()%n;
    l = rand()%n;
    p = rand()%n;    

    if(v[k]<v[l] && v[l]<v[p] || v[p] < v[l] && v[l] < v[k])
        pivot = v[l];
    else if (v[l]<v[k] && v[k]<v[p] || v[p]<v[k] && v[k]<v[l])
        pivot = v[k];
    else
        pivot = v[p];

    int i=st-1;
    for (int j = st; j < dr; j++)
        if(v[j]<=pivot)
        {
            i++;
            swap(v[i],v[j]);
        }
    swap(v[i+1],v[dr]);
    i++;
    quicksort(st,i-1);
    quicksort(i+1,dr);
}

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

    quicksort(0,n-1);
    for(int i=0;i<n;i++) g<<v[i]<<" ";

    return 0;
}