#include <cstdio>
#include <cstring>

#include <iostream>

using namespace std;

const int MAXN = 500001;

int A[MAXN];

void mergesort(int left, int right)
{
    if (left >= right)
        return;
    int m = (left + right) / 2;
    mergesort(left, m);
    mergesort(m + 1, right);

    int i = left, j = m + 1, k = 0;
    int B[right - left + 1];
    while (i <= m && j <= right) 
        if (A[i] <= A[j])
            B[k++] = A[i++];
        else B[k++] = A[j++];
    while (i <= m)
        B[k++] = A[i++];
    while (j <= right)
        B[k++] = A[j++];
    for (i = left, k = 0; i <= right; ++i, ++k)
        A[i] = B[k];
}

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

    int n;
    cin >> n;
    for (int i = 0; i < n; ++i)
        cin >> A[i];
    mergesort(0, n - 1);
    for (int i = 0; i < n - 1; ++i)
        cout << A[i] << " ";
    cout << A[n - 1] << "\n";

    return 0;
}