#include<fstream>
#include<algorithm>
#include<vector>



using namespace std;

vector<int> v[300];

vector <int> :: iterator it;

int a[500005],number[300];

int main()
{
	int i,k,n,q,val,nr;
	ifstream f("algsort.in");
	f>>n;
	for (i=1;i<=n;i++)
		f>>a[i];
	int p=8;
	k=1<<p;
	
	for (q=1;q<=31/p+1;++q)
	{
		for (i=0;i<=k;i++)
			number [i]=0;
		
		for (i=1;i<=n;++i)
		{
			val=(a[i]>>(p*q-p));
			val=val-((val>>p)<<p);
			number[val]++;
		}		
		
		for (i=0;i<k;i++)
		{
			vector<int>().swap(v[i]);
			v[i].reserve(number[i]+2);
		}
	
		for (i=1;i<=n;++i)
		{
			val=(a[i]>>(p*q-p));
			val=val-((val>>p)<<p);
			v[val].push_back(a[i]);
		}	
		
		nr=0;
		for (i=0;i<k;++i)
			for (it=v[i].begin();it<v[i].end();++it)
				a[++nr]=*it;
	}
	
	ofstream g("algsort.out");
	
	for (i=1;i<=n;i++)
		g<<a[i]<<' ';
	f.close();
	g.close();
	return 0;
}