#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

struct STR
{
	char s[1001];
	int l;
}str[100];

bool cmp(STR a,STR b)
{
	if(a.l==b.l)
		return strcmp(a.s,b.s)<0?1:0;
	return a.l<b.l;
}

int main()
{
	int n,i;
	while(scanf("%d",&n)!=EOF)
	{
		for(i=0;i<n;i++)
		{
			scanf("%s",str[i].s);
			str[i].l=strlen(str[i].s);
		}
		sort(str,str+n,cmp);
		for(i=0;i<n;i++)
			puts(str[i].s);
	}
	return 0;
}
/**************************************************************
	Problem: 2202
	User: admin
	Language: C++
	Result: Accepted
	Time:21 ms
	Memory:1248 kb
****************************************************************/