#include <iostream>

#define NMAX 500000

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

    if (n < 2)
        return;

    for (int i = 0, j = n - 1, d = 0; i < j; i += d, j -= (1 - d)) {
        if (v[i] > v[j]) {
            a = v[i];
            v[i] = v[j];
            v[j] = a;

            d = 1 - d;
        }

        m += d;
    }

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

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

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

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