#include <cstdlib>
#include <ctime>

#include <iostream>

#define NMAX 500000

void heap_sort(int *v, int n)
{
    int a;

    if (n < 2)
        return;

    for (int k = n / 2 - 1; k >= 0; --k) {
        for (int i = k, j = i, l, r; 1; i = j) {
            l = 2 * i + 1;
            r = 2 * i + 2;

            if (l < n && v[l] > v[j])
                j = l;

            if (r < n && v[r] > v[j])
                j = r;

            if (j == i)
                break;

            a = v[i];
            v[i] = v[j];
            v[j] = a;
        }
    }

    for (--n; n > 0; --n) {
        a = v[n];
        v[n] = v[0];
        v[0] = a;

        for (int i = 0, j = i, l, r; 1; i = j) {
            l = 2 * i + 1;
            r = 2 * i + 2;

            if (l < n && v[l] > v[j])
                j = l;

            if (r < n && v[r] > v[j])
                j = r;

            if (j == i)
                break;

            a = v[i];
            v[i] = v[j];
            v[j] = a;
        }
    }
}

void merge_sort(int *v, int n)
{
    int *w;

    if (n < 2)
        return;

    merge_sort(v, n / 2);
    merge_sort(v + n / 2, n - n / 2);

    w = new int[n];

    for (int i = 0, j = n / 2, k = 0; /* (i < n / 2 || j < n) && */ k < n; ++k)
        if (j >= n || (i < n / 2 && v[i] < v[j]))
            w[k] = v[i++];
        else // i >= n / 2 || (j < n && v[i] >= v[j])
            w[k] = v[j++];

    for (int i = 0; i < n; ++i)
        v[i] = w[i];

    delete[] w;
}

void quick_sort(int *v, int n)
{
    int a, pivot;
    int m = 0;

    if (n < 2)
        return;

    pivot = v[rand() % n];

    // hoare partition
    for (int i = 0, j = n - 1; 1; ++i, --j, ++m) {
        while (v[i] < pivot) {
            ++i;
            ++m;
        }

        while (v[j] > pivot)
            --j;

        if (i >= j)
            break;

        a = v[i];
        v[i] = v[j];
        v[j] = a;
    }

    // for (int i = 0, j = n - 1; i < j;) {
    //     while (v[i] < pivot) {
    //         ++i;
    //         ++m;
    //     }

    //     while (v[j] > pivot)
    //         --j;

    //     if (i < j) {
    //         a = v[i];
    //         v[i] = v[j];
    //         v[j] = a;

    //         ++i;
    //         --j;

    //         ++m;
    //     }
    // }

    quick_sort(v, m);
    quick_sort(v + m, n - m);
}

int main()
{
    int n;
    int v[NMAX];

    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);

    srand(time(nullptr)); // used by quick sort

    std::cin >> n;

    for (int i = 0; i < n; ++i)
        std::cin >> v[i];

    quick_sort(v, n);

    for (int i = 0; i < n; ++i)
        std::cout << v[i] << ' ';

    std::cout << '\n';

    return 0;
}