#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int N,Array[500002],Aux[500002];
vector <int> V(500002);
void Read()
{
    f>>N;
    int i;
    for(i=1;i<=N;i++)
        f>>Array[i];
}
void DEI(int Left,int Right)
{
    if(Left==Right)
        return;
    int Mid=(Left+Right)/2;
    DEI(Left,Mid);
    DEI(Mid+1,Right);
    int i=Left,j=Mid+1,k=0;
    merge(Array+Left,Array+Mid+1,Array+Mid+1,Array+Right+1,V.begin());
    copy(V.begin(),V.begin()+Right-Left+1,Array+Left);
}
void Print()
{
    int i;
    for(i=1;i<=N;i++)
        g<<Array[i]<<" ";
    g<<"\n";
}
int main()
{
    Read();
    DEI(1,N);
    Print();
    return 0;
}