#include <bits/stdc++.h>

using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int n, a[500005];

void Merge(int l, int m, int r) {
    vector<int> aux(r - l + 1, 0);

    int i = l;
    int j = m;
    int k = 0;

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

    while (i < m) {
        aux[k++] = a[i];
        i++;
    }

    while (j <= r) {
        aux[k++] = a[j];
        j++;
    }

    for (int i = 0; i < k; i++)
        a[l + i] = aux[i];
}

void merge_sort(int l, int r) {
    if (l >= r)
        return;
    int m = (l + r) / 2;
    merge_sort(l, m);
    merge_sort(m + 1, r);

    Merge(l, m + 1, r);
}
int main()
{
    in >> n;
    for (int i = 1; i <= n; i++) {
       in >> a[i];
    }

    merge_sort(1, n);

    for (int i = 1; i <= n; i++)
        out << a[i] << " ";
    return 0;
}