#include <fstream>
using namespace std;

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

int n,v[500001],i;

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

    int i=st,j=dr,aux;
    int di=0;
    int dj=-1;
    while(i<j){
        if(v[i]>v[j]){
            swap(v[i],v[j]);

            aux=di;
            di=-dj;
            dj=-aux;
        }
        i+=di;
        j+=dj;
    }

    quick(st,i-1);
    quick(i+1,dr);
}

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

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

    return 0;
}