#include <fstream>
#include <algorithm>
#include <ctime>

using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");
int v[500010],v1[500010];

void merge_sort(int st,int dr)
{
    if(st>=dr) return;
    int mid=(st+dr)/2;
    merge_sort(st,mid);
    merge_sort(mid+1,dr);
    int nr=0;
    for(int i=st,j=mid+1;i<=mid || j<=dr;)
    {
        if(i<=mid && j<=dr)
        {
            if(v[i]<v[j]) v1[++nr]=v[i++];
            else v1[++nr]=v[j++];
        }
        else if(i<=mid) v1[++nr]=v[i++];
        else v1[++nr]=v[j++];
    }
    for(int i=1;i<=nr;i++) v[st+i-1]=v1[i];
}

int main()
{
    srand(time(0));
    int n;
    fin>>n;
    for(int i=1;i<=n;i++) fin>>v[i];
    merge_sort(1,n);
    for(int i=1;i<=n;i++) fout<<v[i]<<" ";
    return 0;
}