#include <fstream>
#include<algorithm>
using namespace std;
int i,n,a[500010];
int cmp(int a,int b)
{
    if(a>b)return 0;
    else return 1;
}
void merge(int,int,int);
void merge_sort(int low,int high)
{
 int mid;
 if(low<high)
 {
  mid=(low+high)/2;
  merge_sort(low,mid);
  merge_sort(mid+1,high);
  merge(low,mid,high);
 }
}
void merge(int low,int mid,int high)
{
 int h,i,j,b[500010],k;
 h=low;
 i=low;
 j=mid+1;

 while((h<=mid)&&(j<=high))
 {
      if(a[h]<=a[j])
      {
            b[i]=a[h];
            h++;
      }
      else
      {
            b[i]=a[j];
            j++;
      }
      i++;
     }
     if(h>mid)
     {
      for(k=j;k<=high;k++)
      {
           b[i]=a[k];
           i++;
      }
     }
     else
     {
          for(k=h;k<=mid;k++)
          {
               b[i]=a[k];
               i++;
          }
 }
 for(k=low;k<=high;k++) a[k]=b[k];
}
int poz(int p,int u)
{
    int pz=p,i=p,j=u,sens=1,ax;
    while(i<j)
    {
        if(sens==1)
        {
            while(a[pz]<=a[j]&&j>=p)
            j--;
            if(i<j)
            {
                ax=a[j];
                a[j]=a[pz];
                a[pz]=ax;
                pz=j;
                sens=0;
                i++;
            }
        }
        else if(sens==0)
        {
            while(a[pz]>=a[i]&&i<=u)
            i++;
            if(i<j)
            {
                ax=a[i];
                a[i]=a[pz];
                a[pz]=ax;
                pz=i;
                sens=1;
                j--;
            }
        }

    }
    return pz;
}
void qsort(int p,int u)
{
    int k,ax;
    if(u-p==1)
    {
        if(a[p]>a[u])
        {
            ax=a[u];
            a[u]=a[p];
            a[p]=ax;
        }
    }
    else
    if(p+1<u)
    {
        k=poz(p,u);
        qsort(p,k-1);
        qsort(k+1,u);
    }
}
int main()
{
    //freopen("algsort.in","r",stdin);
    //freopen("algsort.out","w",stdout);
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    f>>n;
    for(i=1;i<=n;i++)
    f>>a[i];
   // merge_sort(1,n);
   // sort(a+1,a+1+n,cmp);
    qsort(1,n);
    for(i=1;i<=n;i++)
    g<<a[i]<<' ';
    //printf("%d ",a[i]);
    return 0;
}