#include <fstream>
#include <iostream>
#include <algorithm>

using namespace std;

const int N = 5e5;
int aux[N], v[N];

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

void mergeSort(int v[], int st, int dr) {
    if (st == dr)
        return;
    int m = (st + dr) / 2;
    mergeSort(v, st, m);
    mergeSort(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];
    }
    mergeSort(v, 0, n - 1);
    for (int i = 0; i < n; i++) {
        fout << v[i] << " ";
    }
    fin.close();
    fout.close();

    return 0;
}