#include <cstdio>
#include <queue>

using namespace std;

int N, v[500000];

void RadixSort(int v[], int left, int right)
{
    queue<int> bucket[256];

    for(int j = 0; j < 4; j++)
    {
        for(int i = left; i <= right; i++)
        {
            bucket[(v[i] >> (8 * j)) & 255].push(v[i]);
        }

        int index = -1;

        for(int i = 0; i < 256; i++)
        {
            while(!bucket[i].empty())
            {
                v[++index] = bucket[i].front();

                bucket[i].pop();
            }
        }
    }
}
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]);
    }

    RadixSort(v, 0, N-1);

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

    return 0;
}