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

int st[50005];

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

    for(unsigned int i = N; i; ++frequence[A[--i] >> digit & 0x7FF]);

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

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

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

    static unsigned int p = 0x0; unsigned int number = 0x0;

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

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

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

        if(inBuffer[p] < 0x30 || inBuffer[p] > 0x39) break;
    }

    return number;
}

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

__attribute__((always_inline)) void put_number(unsigned int x)
{
    unsigned 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(unsigned int i = digits; --i; x /= 0xA)
    {
        outBuffer[p + i] = x % 0xA + 0x30;
    }

    outBuffer[p = p + digits] = 0x20;
}

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

    unsigned int N, v[0x80000], w[0x80000]; ///declara vectorii global daca iei (0xC00000FD)

    N = get_number();

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

    v[0x0] = get_number();

    CountingSort(N, v, w, 0x0);
    CountingSort(N, w, v, 0xB);
    CountingSort(N, v, w, 0x16);
    for (int i = 1; i <= N; ++i)
      printf("%d ", w[i]);

    return 0x0;
}