#include <bits/stdc++.h>

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

#define MASK 255

int x[MASK + 1];

void CountingSort(int v[], int w[], int bit) {
  memset(x, 0, sizeof x);
  for (int i = 0; i < N; ++i) ++x[v[i] >> bit & MASK];
  for (int i = MASK; i > 0; --i) x[i] = x[i - 1]; x[0] = -1;
  for (int i = 1; i <= MASK; ++i) x[i] += x[i - 1];
  for (int i = 0; i < N; ++i) w[++x[v[i] >> bit & MASK]] = v[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]);
    }

    CountingSort(v, w,  0);
    CountingSort(w, v,  8);
    CountingSort(v, w, 16);
    CountingSort(w, v, 24);

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

    return 0;
}