// quicksort
# include <fstream>
# include <stdlib.h>
# include <time.h>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,v[500005],i,p, aux;
int poz (int st,int dr){
    int aux,ii=0,jj=-1;
    while(st<dr){
        if(v[st]>v[dr]){
            aux=v[st];
            v[st]=v[dr];
            v[dr]=aux;
            aux=ii;
            ii=-jj;
            jj=-aux;
        }
        st+=ii;
        dr+=jj;
    }
    return st;
}
void srt(int st,int dr){
    if(st<dr){
        int p=poz(st,dr);
        srt(st,p-1);
        srt(p+1,dr);
    }
}
int main () {
    fin>>n;
    for(i=1;i<=n;i++){
        fin>>v[i];
    }
    srand(time(0));
// se apeleaza o singura data, la inceput
    for (i=n;i>=2;i--) {
        //rand() // da un numar aleator intre 0 32000
//        rand()%n da aleator intre 0 si n-1
        p = 1 + rand()%(i-1); // numaraleator intre 1 si i-1
        aux = v[i];
        v[i] = v[p];
        v[p] = aux;
    }

    srt(1,n);
    for(i=1;i<=n;i++){
        fout<<v[i]<<" ";
    }
    return 0;
}