#include <iostream>

#define NMAX 500000

void merge_sort(int *v, int n)
{
    if (n < 2)
        return;

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

    int i, j, k;
    int w[NMAX];

    i = 0;
    j = n / 2;
    k = 0;

    while (i < n / 2 && j < n)
        if (v[i] < v[j])
            w[k++] = v[i++];
        else
            w[k++] = v[j++];

    while (i < n / 2)
        w[k++] = v[i++];

    while (j < n)
        w[k++] = v[j++];

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

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

    merge_sort(v, n);

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

    std::cout << '\n';

    return 0;
}