#include <bits/stdc++.h>

using namespace std;

int N, v[500000], w[500000];

__attribute__((always_inline)) void CountingSort(int A[], int B[], int digit)
{
    int frequence[2048]{}, index[2048], i = N; index[0] = ~0;

    while(i) ++frequence[A[--i] >> digit & 2047];

    for(; i != 2048; index[++i] = index[~-i] + frequence[~-i]);

    for(i = 0; i != N; ++i) B[++index[A[i] >> digit & 2047]] = A[i];
}

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

    scanf("%d", &N);

    for(int i = 0; i != N; ++i)
    {
        scanf("%d", &v[i]);
    }

    sort(v, v + N);

    for(int i = 0; i != N; ++i)
    {
        printf("%d ", v[i]);
    }

    return 0;
}