#include <fstream>

using namespace std;

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

void Quicksort(int v[], int st, int dr) {
    if(st < dr) {
        int m = (st + dr) / 2;
        int aux = v[st];
        v[st] = v[m];
        v[m] = aux;
        int i = st, j = dr, d = 0;
        while(i < j) {
            if(v[i] > v[j]) {
                aux = v[i];
                v[i] = v[j];
                v[j] = aux;
                d = 1 - d;
            }
            i += d;
            j -= 1 - d;
        }
        Quicksort(v, st, i - 1);
        Quicksort(v, i + 1, dr);
    }
}

int n, v[500005];

int main() {
    fin >> n;
    for(int i = 1; i <= n; i++) {
        fin >> v[i];
    }
    fin.close();
    Quicksort(v, 1, n);
    for(int i = 1; i <= n; i++) {
        fout << v[i] << " ";
    }
    fout.close();
    return 0;
}