#include<cstdio>
#include<algorithm>
#include<vector>


using namespace std;

vector<int> v[100];

vector <int> :: iterator it,it1;

int a[500005];

int main()
{
	int i,k,n,q,val,nr;
	
	freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
	for (i=1;i<=n;i++)
		scanf("%d",&a[i]);
 
	int p=4;
	k=1<<p;
	
	for (q=1;q<=31/p+1;++q)
	{
		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;
			if (v[i].begin<v[i].end())
		  {
			it=v[i].end();--it;
			for (;it>v[i].begin();)
			{
				it1=it;
				it.erase();
				it=it1-1;
			}
			it.erase();
		  }
			
		}
	}
	
	
	
	for (i=1;i<=n;i++)
	    printf("%d ",v[i])
	return 0;
}