#include <iostream>
#include <fstream>

using namespace std;

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

const int MAX=5e5+5;
int i,j,v[MAX],tmp[MAX],k,n;

void mergesort(int st, int dr)
{
    if(st==dr)
        return;
    int m=(st+dr)/2;
    mergesort(st,m);
    mergesort(m+1,dr);
    k=0;
    i=st;
    j=m+1;
    while(i<=m && j<=dr)
        if(v[i]<v[j])
            tmp[++k]=v[i++];
        else
            tmp[++k]=v[j++];
    while(i<=m)
        tmp[++k]=v[i++];
    while(j<=dr)
        tmp[++k]=v[j++];
    for(i=st,j=1;i<=dr;i++,j++)
        v[i]=tmp[j];
}

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