#include <fstream>
#include <algorithm>
using namespace std;
ifstream in ("algsort.in");
ofstream out ("algsort.out");
int Quicksort(int v[],int st,int dr)
{
    int mijl=v[(st+dr)/2],i=st,j=dr;
    while(i<=j)
          {
                while(v[i]<mijl)
                    ++i;
                while(v[j]>mijl)
                    --j;
                if(i<=j)
                    swap(v[i++],v[j--]);
          }
    if(st<j)
        Quicksort(v,st,j);
    if(dr>i)
        Quicksort(v,i,dr);
}
int main()
{
    int v[100000],n,i;
    in>>n;
    for(i=1;i<=n;++i)
        in>>v[i];
    Quicksort(v, 1,n);
    for(i=1;i<=n;++i)
        out<<v[i]<<" ";
    return 0;
}