#include <cstdlib>
#include <ctime>

#include <iostream>

#define NMAX 500000

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

    if (n < 2)
        return;

    pivot = v[rand() % n];

    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;
    }

    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;
}