#include <fstream>
#include<iostream>
using namespace std;
ifstream in ("algsort.in");
ofstream out ("algsort.out");
void qsort(long long i,long long n, long long v[])
{ long long p=i,u=n,pivot=v[(i+n)/2];
while(p<=u)
{
   while(v[p]<pivot)
        p++;
   while(v[u]>pivot)
    u--;
   if(p<u)
   {
       swap(p,u);
       p++;
       u--;
   }
}
if(i<p)
    qsort(i,p,v[]);
if(u<n)
    qsort(u,n,v[]);


}
int main()
{
    long long v[500000],i,n,j;
    in>>n;
    for(i=1;i<=n;i++)
        in>>v[i];
  qsort(i,n,v[n]);
    for(i=1;i<=n;i++)
        out<<v[i]<<" ";


}