#include <fstream>
#include <cstdlib>
using namespace std;

const int N=500005;
int v[N],aux[N],n;

ifstream in("algsort.in");
ofstream out("algsort.out");

void merge(int st,int dr)
{
    if (st==dr)
        return;
    int m=st+dr>>1;
    merge(st,m);merge(m+1,dr);
    for (int i=st,j=m+1,k=st;k<=dr;k++)
        if (j>dr || i<=m && v[i]<v[j])
            aux[k]=v[i++];
        else
            aux[k]=v[j++];
    for (int i=st;i<=dr;i++)
        v[i]=aux[i];
}

inline void sch(int &a,int &b)
{
    int c=a;a=b;b=c;
}

void quick(int st,int dr)
{
    if (st>=dr)
        return;
    int p=v[st+rand()%(dr-st)],i,j;
    for (i=st,j=dr;i<j;)
    {
        while (i<j && v[i]<p) i++;
        while (i<j && v[j]>p) j--;
        if (i!=j && v[i]==v[j])
            i++;
        while (i<j && v[i]>p) i++;
        sch(v[i],v[j]);
    }
    quick(st,i-1);quick(i+1,dr);
}

int main()
{
    in>>n;
    for (int i=1;i<=n;i++)
        in>>v[i];
    merge(1,n);
    for (int i=1;i<=n;i++)
        out<<v[i]<<" ";
    out<<"\n";
    return 0;
}