#include<fstream>
using namespace std;
long long v[500001],z[500001];
void interclasare(int i,int j)
{
    int m=(i+j)/2,p=i,q=m+1,k=0;
    while(p<=m && q<=j)
        if(v[p]<v[q])z[++k]=v[p++];
        else if(v[p]>v[q])z[++k]=v[q++];
        else {z[++k]=v[p];++p;++q;}
    while(p<=m)z[++k]=v[p++];
    while(q<=j)z[++k]=v[q++];
    for(p=1,q=i;p<=k;++p,++q)
        v[q]=z[p];
}
void interclasare2( int i, int j)
{
int p,q,k=0,m;
m=(i+j)/2;
p=i;
q=m+1;
while(p<=m && q<=j)
{
if(v[p]<v[q]) z[++k]=v[p++];
else z[++k]=v[q++];
}
while(p<=m) z[++k]=v[p++];
while(q<=j) z[++k]=v[q++];
for(p=i,k=1;p<=j;k++,p++)
	v[p]=z[k];
}
void MergeSort(int i,int j)
{
    if(i<j)
    {
        int m=(i+j)/2;
        MergeSort(i,m);
        MergeSort(m+1,j);
        interclasare2(i,j);
    }
}
int main()
{
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    int n,i;
    f>>n;
    for(i=1;i<=n;++i)
        f>>v[i];
    MergeSort(1,n);
    for(i=1;i<=n;++i)
        g<<v[i]<<" ";
    f.close();
    g.close();
    return 0;
}