#include <bits/stdc++.h>

using namespace std;

const int Nmax = 500005;

int v[Nmax], vaux[Nmax], n;

void merge_sort(int s, int d)
{
    if (s >= d) return;
    int m = (s + d) >> 1;
    merge_sort(s, m);
    merge_sort(m + 1, d);
    for (int i = s, i1 = m + 1, k = s; i <= m || i1 <= d;)
        if (i1 > d || (i <= m && v[i] <= v[i1]))
            vaux[k++] = v[i++];
        else vaux[k++] = v[i1++];
    for (int k = s; k <= d; k++)
        v[k] = vaux[k];
}

int main()
{
    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
        scanf("%d", &v[i]);
    merge_sort(1, n);
    for (int i = 1; i <= n; i++)
        printf("%d ", v[i]);
}