#include <fstream>
#include <queue>

using namespace std;

int v[500005],n,maxim;
queue <int> buckets[1<<8];

void RadixSort()
{
	int i,j,x,k;
	for(i=0;maxim;maxim>>=8,i+=8)
	{
		for(j=1;j<=n;++j)
		{
			x=(v[j]>>i)&255;
			buckets[x].push(v[j]);
		}
		k=0;
		for(j=0;j<=255;++j)
		{
			while( !buckets[j].empty() )
			{
				v[++k]=buckets[j].front();
				buckets[j].pop();
			}
		}
	}
}

int main()
{	
	ifstream f("algsort.in");
	ofstream g("algsort.out");
	int i;
	f>>n;
	for(i=1;i<=n;++i)
	{
		f>>v[i];
		if(v[i]>maxim)	maxim=v[i];
	}
	RadixSort();
	for(i=1;i<=n;++i)
		g<<v[i]<<" ";
	return 0;
}