// bucket sort
// each bucket is sorted with std::sort

#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

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 NO_VALUES (1 << 31)
#define NO_BUCKETS (1 << 16)
#define VALUES_PER_BUCKET (1 << 15)
#define VALUES_PER_BUCKET_BITS 15

vector<int> bucket[NO_BUCKETS];

inline int getBucketNumber(int value) {
  return value >> VALUES_PER_BUCKET_BITS;
}

void sort(int bucketIndex) {
  sort(bucket[bucketIndex].begin(), bucket[bucketIndex].end());
}

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

  for (i = 0; i < NO_BUCKETS; ++i)
    sort(i);

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