#include<iostream>
#include<fstream>
using namespace std;
unsigned long a[500000];
int n,s,i;

void poz (int li,int ls)
{
     int i=li,j=ls,c,i1=0,j1=-1;
     while (i<j)
     {
         if (a[i]>a[j])
         {
             a[i]=a[i]^a[j]^(a[j]=a[i]);
             c=i1; i1=-j1; j1=-c;
         }
        i+=i1;
        j+=j1;
     }
         s=i;
}

void quick (int li,int ls)
{
    if(li<ls)
    {
        poz(li,ls);
        quick(li,s-1);
        quick(s+1,ls);
}
}
int main()
{
    ifstream f("algsort.in");
    ofstream g("algsort.out");
f>>n;
    for(i=1;i<=n;i++)
        f>>a[i];
    quick(1,n);
        for(i=1;i<=n;i++) g<<a[i]<<" ";
        f.close();
        g.close();
        return 0;
}