#include <iostream>
#include <fstream>
 
using namespace std;
 
ifstream in("algsort.in");
ofstream out("algsort.out");
 
int v[500005];
int b[500005],c[500005],n;
void uneste(int l,int m,int r)
{
    for(int i=l; i<=m; i++)
        b[i]=v[i];
    for(int i= m + 1; i<=r; i++)
        c[i]=v[i];
    int i=l,j=m + 1,k=l;
    while(i <= m and j <= r)
    {
        if(b[i]<=c[j])
        {
            v[k++]=b[i];
            i++;
        }
        else
        {
            v[k++]=c[j];
            j++;
        }
    }
    while(i<=m)
    {
        v[k++]=b[i];
        i++;
    }
    while(j<=r)
    {
        v[k++]=c[j];
        j++;
    }
}
void mergesort(int ileft,int iright)
{
 
    if(iright>ileft)
    {
        int m = ileft + (iright - ileft) / 2;
        mergesort(ileft,m);
        mergesort(m+1,iright);
        uneste(ileft,m,iright);
    }
}
int main()
{
 
 
    in>>n;
    for(int i=1; i<=n; i++)
        in>>v[i];
    mergesort(1,n);
    for(int i=1; i<=n; i++)
        out<<v[i]<<" ";
    return 0;
}