#include <cstdio>
#include <string.h>

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];
}

__attribute__((always_inline)) int get_nr()
{
    static char inBuffer[0x8000];

    static int p = 0x0; int num = 0x0;

    while(inBuffer[p] < 48|| inBuffer[p] > 57)
    {
        ++p == 0x8000 && (fread(inBuffer, 0x1, 0x8000, stdin), p = 0x0);
    }

    for(;;)
    {
        num = num * 0xA + inBuffer[p] - 0x30;

        ++p == 0x8000 && (fread(inBuffer, 0x1, 0x8000, stdin), p = 0x0);

        if(inBuffer[p] < 48 || inBuffer[p] > 57) break;
    }

    return num;
}

char outBuffer[0x4C4B40]; int p = ~0x0;

__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; x /= 10)
    {
        outBuffer[p + i] = x % 10 + 48;
    }

    p = p + digits;
}

int main()
{
    memset(outBuffer, 32, 0x4C4B3F);

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

    N = get_nr();

    for(int i = N; --i;)
    {
        v[i] = get_nr();
    }

    v[0] = get_nr();

    CountingSort(v, w, 0x0);
    CountingSort(w, v, 0xB);
    CountingSort(v, w, 0x16);

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

    fwrite(outBuffer, 0x1, p, stdout);

    return 0x0;
}