// Radix sort with base 2

#include <stdio.h>

void swap(int& a, int& b) {
  int aux = a;
  a = b;
  b = aux;
}

inline bool isDigit(char c) {
  return c >= '0' && c <= '9';
}

// citire numar natural
int readInt(FILE* fin) {
  char ch;
  int res = 0;

  // eliminam caracterele de dinaintea numarului (spatiu, rand nou, orice caracter care nu este cifra)
  while (!isDigit(ch = fgetc(fin)));

  // adaugam cifrele la numar pana cand caracterul citit nu mai este cifra
  do {
    res = 10 * res + ch - '0';
  } while (isDigit(ch = fgetc(fin)));

  return res;
}

#define MAX_N 3000000

int v[MAX_N];

void sort(int v[], int left, int right, int bitNumber) {
  if (left >= right || bitNumber == -1)
    return;

  int i, j;
  for (i = left, j = left; i <= right; ++i)
    if ((v[i] & (1 << bitNumber)) == 0) {
      swap(v[i], v[j]);
      ++j;
    }

  sort(v, left, j - 1, bitNumber - 1);
  sort(v, j, right, bitNumber - 1);
}

int main() {
  FILE* fin = fopen("algsort.in", "r");
  int n, i;
  fscanf(fin, "%d", &n);
  for (i = 0; i < n; ++i)
    v[i] = readInt(fin);
  fclose(fin);

  sort(v, 0, n - 1, 30);

  FILE* fout = fopen("algsort.out", "w");
  for (i = 0; i < n; ++i)
    fprintf(fout, "%d ", v[i]);
  fclose(fout);
  return 0;
}