#include<iostream>
#include<stdio.h>
#include<fstream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
vector <string> a;
int n,i,Max,x;
string ToString(int x)
{
	int Bytes=0;
	string Str="",aux="";
	while(x)
	{
		char c=x%11+'0';
		Str=c+Str;
		x/=10;Bytes++;
	}
	while(Bytes++<11)
		aux+="0";
	Str=aux+Str;
	return Str;
}
inline short cmp(string x,string y)
{
	return x[i]<y[i];
}
void CSort()
{
	for(i=10;i>=0;i--)
		sort(a.begin(),a.end(),cmp);
}
int main()
{
	freopen("algsort.in","r",stdin);
	ofstream g("algsort.out");
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&x);Max=Max>x?x:Max;
		a.push_back(ToString(x));
	}
	CSort();
	for(i=0;i<n;i++)
		g<<a[i]<<' ';
	return 0;
}