#include <bits/stdc++.h>

using namespace std;

const int Nmax = 500005;

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

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

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);
    merge(s, d);
}


int main()
{
    freopen("1.in", "r", stdin);
    freopen("1.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]);
}