using namespace std;
#include<fstream>
int n,*a;
void quick(int,int);
int main()
{
    int i;
    ifstream fin("algsort.in");
    fin>>n;
    a=new int[n+1];
    for(i=1;i<=n;++i)
       fin>>a[i];
    fin.close();
    quick(1,n);
    ofstream fout("algsort.out");
    for(i=1;i<=n;++i)
       fout<<a[i]<<' ';
    fout.close();
    return 0;
}
void quick(int s,int d)
{
     if(s<d)
     {
            int i=s,j=d,dd=0,aux;
            while(i<j)
            {
                      if(a[i]>a[j])
                      {
                                   aux=a[i];
                                   a[i]=a[j];
                                   a[j]=aux;
                                   dd=1-dd;
                      }
                      i+=dd;
                      j-=1-dd;
            }
            quick(s,i-1);
            quick(i+1,d);
     }
}