#include <bits/stdc++.h>
using namespace std;

void merge_arr(int v[], int p, int q, int r) {
    int n1 = q - p + 1;
    int n2 = r - q;
    int L[n1], M[n2];

    for(int i = 0; i < n1; i++)
        L[i] = v[p + i];
    for(int i = 0; i < n2; i++)
        M[i] = v[q + 1 + i];

    int i = 0, j = 0, k = p;
    while(i < n1 && j < n2) {
        if(L[i] <= M[j]) {
            v[k] = L[i];
            i++;
        } else {
            v[k] = M[j];
            j++;
        }
        k++;
    }
    while (i < n1) {
        v[k] = L[i];
        i++;
        k++;
    }

    while (j < n2) {
        v[k] = M[j];
        j++;
        k++;
    }

}

void merge_sort(int v[], int st, int dr) {
    if(st >= dr)
        return;
    int mid = st + (dr - st) / 2;

    merge_sort(v, st, mid);
    merge_sort(v, mid + 1, dr);

    return merge_arr(v, st, mid, dr);
}

void quick_sort(int v[], int st, int dr) {
    if (st >= dr)
        return;
    int piv = rand() % (dr - st + 1) + st;
    int aux = v[st];
    v[st] = v[piv];
    v[piv] = aux;
    int i = st, j = dr, d = 0;
    while(i < j) {
        if(v[i] > v[j]) {
            int aux = v[i];
            v[i] = v[j];
            v[j] = aux;
            d = 1 - d;
        }
        i += d;
        j -= 1 - d;
    }
    quick_sort(v, st, i - 1);
    quick_sort(v, i + 1, dr);
}

int main()
{
    srand (time(NULL));
    int n, v[500001];
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    f>>n;
    for(int i = 0; i < n; i++)
        f>>v[i];
    quick_sort(v, 0, n - 1);
    for(int i = 0; i < n; i++)
        g<<v[i]<<" ";
    return 0;
}