#include <iostream>
#include <fstream>

using namespace std;

int v[500001];
int aux[500001];

void interclasare(int v[], int st, int dr){
    int m = (st + dr) / 2;
    int i = st, j = m + 1, k = st;
    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 = st; k <= dr; k++)
        v[k] = aux[k];
}

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

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

    int n;
    fin >> n;

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

    ms(v, 0, n - 1);

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

    return 0;
}