#include <fstream>

using namespace std;

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

#define N 500000

int aux[N], v[N], n;

void merge(int st, int dr)
{
    int m=(st+dr)/2;
    int i=st, j=m+1, k=1;

    while(i<=m && j<=dr)
    {
        if(v[i]<=v[j])
            aux[k++]=v[i++];
        else
            aux[k++]=v[j++];
    }
    while(i<=m)
        aux[k++]=v[i++];
    while(j<=dr)
        aux[k++]=v[j++];

    for(k=1;k<=dr-st+1;k++)
        v[st+k-1]=aux[k];
}

void ms(int st, int dr)
{
    int m = (st+dr)/2;
    if(st==dr)
        return ;

    ms(st, m);
    ms(m+1, dr);

    merge(st, dr);
}

int main()
{
    in >> n;

    for(int i=0;i<n;i++)
        in >> v[i];

    ms(0, n-1);

    for(int i=0;i<n;i++)
       out << v[i] << " ";

    in.close();
    out.close();
    return 0;
}