#include<fstream>
#include<ctime>
#include<cstdlib>
#define numaru 500001
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[numaru],n;
int pickrand(int p, int q)
{
    int z[3],i,j; for(i=0;i<3;++i)z[i]=rand()%(p-q)+p+1; for(i=0;i<2;++i)for(j=i+1;j<3;++j)if(v[z[i]]>v[z[j]])z[i]=(z[i]+z[j])-(z[j]=z[i]);
    return z[1];
}
void sortsort(int p,int q)
{
    if(p<q)
    {
        int i=p,j=q,k=pickrand(p,q) ,x=v[k];
        while(i<j)
        {
            while( v[i]<x )++i;
            while( v[j]>x )--j;
            if(v[i]==v[j])++i;
            if(i<j) v[i]=(v[i]+v[j])-(v[j]=v[i]);
        }
        sortsort(p,j-1);
        sortsort(j+1,q);
    }
}
int main()
{
    f>>n; for(int i=1;i<=n;++i)f>>v[i];
    sortsort(1,n);
    for(int i=1;i<=n;g<<v[i]<<" ",++i);
    f.close();
    g.close();
    return 0;
}