#include <iostream>
#include<fstream>
using namespace std;
long v[500 001]; long n;
 void quicksort(long v[], long left,long right)
 {
     long i=left, j=right;
     long aux;
      long pivot=v[(left+right)/2];
         while (i<=j)
          {
              while (v[i]<pivot)
                i++;
                while (v[j]>pivot)
                 j--;
               if (i<=j)
                {
                    aux=v[i];v[i]=v[j];v[j]=aux;
                    i++;j--;
                }
          }
          if (left<j)
              quicksort(v,left,j);
              if (right>i)
              quicksort(v,i,right);
 }


int main()
{  ifstream cit("algsort.in");
   ofstream scr("algsort.out");
    long i;
     cit>>n;
     for (i=1;i<=n;i++)
        cit>>v[i];
        quicksort(v,1,n);
        for (i=1;i<=n;i++)
          scr<<v[i]<<" ";
    return 0;
}