#include <cstdio>
#pragma GCC optimize("O1")

int N, v[0x80000], w[0x80000];

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

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

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

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

char inBuffer[0x8000]; int p = 0x0;

__attribute__((always_inline)) void read(int &num)
{
    num = 0x0;

    while(inBuffer[p] < 0x30 || inBuffer[p] > 0x39)
    {
        ++p != 0x8000 || (fread(inBuffer, 0x1, 0x8000, stdin), p = 0x0);
    }

    while(inBuffer[p] > 0x2F && inBuffer[p] < 0x3A)
    {
        num = num * 0xA + inBuffer[p] - 0x30;

        ++p != 0x8000 || (fread(inBuffer, 0x1, 0x8000, stdin), p = 0x0);
    }
}

char outBuffer[5000000]; int p1 = -1;

__attribute__((always_inline)) void itoa(int x)
{
    int digits = x > 0x3B9AC9FF ? 0xB :
                 x > 0x5F5E0FF  ? 0xA :
                 x > 0x98967F   ? 0x9 :
                 x > 0xF423F    ? 0x8 :
                 x > 0x1869F    ? 0x7 :
                 x > 0x270F     ? 0x6 :
                 x > 0x3E7      ? 0x5 :
                 x > 0x63       ? 0x4 :
                 x > 0x9        ? 0x3 : 0x2;

    for(int i = digits; --i;)
    {
        outBuffer[p1 + i] = x % 10 + 48;

        x /= 10;
    }

    outBuffer[p1 += digits] = 32;
}

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

    read(N);

    for(int i = 0; i != N; ++i)
    {
        read(v[i]);
    }

    CountingSort(v, w,  0);
    CountingSort(w, v, 11);
    CountingSort(v, w, 22);

    for(int i = 0; i != N; ++i)
    {
        itoa(w[i]);
    }

    puts(outBuffer);

    return 0x0;
}