#include <bits/stdc++.h>
#define n_max 500001

using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n;
int v[n_max];

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

int pivot(int left, int right)
{
  int index = left - 1;
  int p = v[right];

  for(int i = left;i < right;++i)
    if(v[i] >= p)
    {
      index++;
      swap(v[index], v[i]);
    }
  swap(v[index + 1], v[right]);

  return index + 1;
}

void quicksort(int left, int right)
{
  if(left < right)
  {
    int p = pivot(left, right);
    quicksort(left, p - 1);
    quicksort(p + 1, right);
  }
}

#define get_byte(x) ((x >> (8 * byte)) & 255)

void countsort(int *arr1, int *arr2, int byte)
{
  int counter[1 << 8];
  int index[1 << 8];

  memset(counter, 0, sizeof(counter));

  for(int i = 1;i <= n;++i)
    counter[get_byte(arr1[i])]++;
   
  index[0] = 1;
  for(int i = 1;i < (1 << 8);++i)
    index[i] = index[i - 1] + counter[i - 1];
  
  for(int i = 1;i <= n;++i)
    arr2[index[get_byte(arr1[i])]++] = arr1[i];
}

void radixsort()
{
  int tmp[n_max];
  for(int i = 0;i < 4;++i)
    if(i & 1)
      countsort(tmp, v, i);
    else
      countsort(v, tmp, i);
  
}

void solve()
{
  radixsort();
  for(int i = 1;i <= n;++i)
    g<<v[i]<<" ";
}

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