#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <unordered_map>
#include <algorithm>

using namespace std;
#define radix 255
#define get_byte(x) ((x >> (8 * byte)) & 255)

ifstream f("algsort.in");
ofstream g("algsort.out");
int n;
int arr[500001];

void read() {
  f>>n;
  for(int i = 0;i < n;++i) {
    f>>arr[i];
  }
}

void radix_step(int *a, int *b, int byte) {
  int count[1 << 8];
  int index[1 << 8];

  memset(count, 0, sizeof(int) * 255);

  for(int i = 0;i < n;++i) {
    count[get_byte(arr[i])]++;
  }

  index[0] = 0;
  for(int i = 1;i < 255;++i) {
    index[i] = index[i - 1] + count[i - 1];
  }

  for(int i = 0;i < n;++i) {
    b[index[get_byte(a[i])]++] = a[i];
  }
}

void solve() {
  int tmp[500001];
  for(int i = 0;i < 4;++i) {
    if(i & 1) {
      radix_step(tmp, arr, i);
    } else {
      radix_step(arr, tmp, i);
    }
  }
  for(int i = 0;i < n;++i) {
    g<<arr[i]<<" ";
  }
}

int main() {
  read();
  solve();
  return 0;
}