#include <stdio.h>
char a[15001][10];
int n;
long nr[15001];
void read_solve ()
{
	int i,j,max;
	long aux;
	scanf ("%d",&n);
	for (i=1; i<=n; ++i)
	{
		scanf ("%ld",&nr[i]);
		aux=nr[i];
		while (aux)
		{
			a[i][aux%10]++;
			aux/=10;
		}
	}
	for (i=0; i<=9; ++i)
	{
		max=0;
		for (j=1; j<=n; ++j)
			if (a[j][i]>max)
				max=a[j][i];
		for (j=1; j<=n; ++j)
			if (a[j][i]==max && max)
				printf ("%ld ",nr[j]);
		printf ("\n");
	}
}
int main ()
{
	freopen ("numere.in","r",stdin);
	freopen ("numere.out","w",stdout);
	read_solve ();
	return 0;
}