#include <fstream>

using namespace std;

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

int n, v[500001], _v[500001], nr;


void Merge (int x1, int y1, int x2, int y2) {
    int i = x1, j = x2;
    nr = 0;
    while (i <= y1 && j <= y2) {
        if (v[i] < v[j]) {
            _v[++nr] = v[i++];
        }
        else
            if (v[i] > v[j])
                _v[++nr] = v[j++];
            else {
                _v[++nr] = v[i++];
                _v[++nr] = v[j++];
            }
    }
    while (i <= y1) {
        _v[++nr] = v[i++];
    }
    while (j <= y2) {
        _v[++nr] = v[j++];
    }
}

void MergeSort (int x, int y) {
    if (x != y) {
        int mid = (x + y) / 2;
        MergeSort (x, mid);
        MergeSort (mid + 1, y);
        Merge (x, mid, mid + 1, y);

        for (int i = x; i <= y; i++)
            v[i] = _v[i - x + 1];
    }
}

int main () {
    fin >> n;
    for (int i = 1; i <= n; i++) {
        fin >> v[i];
    }

    MergeSort (1, n);

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

    return 0;
}