#include <iostream>
#include <fstream>

///#include <tryhardmode>
///#include <godmode::ON>
///#include <PracticeMakesPerfect>

using namespace std;

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

const int NMAX=5e5+5;
int v[NMAX];
int aux[NMAX];

void interclasare(int v[],int st,int dr)
{
    int kon,mij,i,j;
    mij=(st+dr)/2;
    i=kon=st;
    j=mij+1;
    while(i<=mij && j<=dr)
    {
        if(v[i]<v[j])
            aux[kon++]=v[i++];
        else
            aux[kon++]=v[j++];
    }
    while(i<=mij)
        aux[kon++]=v[i++];
    while(j<=dr)
        aux[kon++]=v[j++];
    for(kon=st;kon<=dr;kon++)
        v[kon]=aux[kon];
}

void merges(int v[],int st,int dr)
{
    int mij;
    if(st==dr)
        return ;
    mij=(st+dr)/2;
    merges(v,st,mij);
    merges(v,mij+1,dr);
    interclasare(v,st,dr);
}

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