#include <iostream>

using namespace std;
int v[100001], w[100001];

/// Quick sort
int poz(int st, int dr) {
    int di = 0;
    int dj = -1;
    int i = st;
    int j = dr;
    int aux;
    while (i < j) {
        if (v[i] > v[j]) {
            aux = v[i];
            v[i] = v[j];
            v[j] = aux;
            
            aux = -di;
            di = -dj;
            dj = aux;
        }
        i += di;
        j += dj;
    }
}
void qsort(int st, int dr) {
    if (st < dr) {
        int p = poz(st, dr);
        qsort(st, p - 1);
        qsort(p + 1, dr);
        return;
    }
}

int main()
{
    int n;
    cin >> n;
    for (int i = 0;i < n;i++) {
        cin >> v[i];
    }
    qsort(0, n - 1);
    for (int i = 0;i < n;i++) {
        cout << v[i] << " ";
    }
    return 0;
}