#include <fstream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;

ifstream cin("algsort.in");
ofstream cout("algsort.out");

int n;

vector <int> v;
vector <int> hash[3007];

void extract()
{
  int idx = 0;
  for (int i = 0; i < n; i++)
    {
      sort(hash[i].begin(), hash[i].end());
      for (vector<int>::iterator it = hash[i].begin(); it != hash[i].end(); it++)
	  v[idx++] = *it;
    }
}

void bucketSort ()
{
  for (int i = 0; i < n; ++i)
    {
      int k = floor(v[i] / 3);
      hash[k].push_back(v[i]);
    }

  extract();
}

int main()
{
  cin >> n;
  
  int x;
  for (int i = 0; i < n; ++i)
    {
      cin >> x;
      v.push_back(x);
    }
  
  bucketSort();

  for (int i = 0; i < n; ++i)
    cout << v[i] << " ";
}