C++ :

#include<bits/stdc++.h>
using namespace std;
int n,bj1,bj2;
string s1[55],s2[55],s3[55],s;
bool cmp1(string s1,string s2)
{
	return s1<s2;
}
bool cmp2(string s1,string s2)
{
	return s1.size()<s2.size();
}
int main()
{
//	freopen("747.in","r",stdin);
//	freopen("747.out","w",stdout);	
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>s;
		s1[i]=s2[i]=s3[i]=s;
    }	
    sort(s2,s2+n,cmp1);
    sort(s3,s3+n,cmp2);
	for(int i=0;i<n;i++)
		if(s1[i]!=s2[i]) bj1=1;
	for(int i=0;i<n;i++)
		if(s1[i]!=s3[i]) bj2=1;	
	if(bj1==0 && bj2==0) cout<<"both";
	if(bj1==1 && bj2==1) cout<<"none";	
	if(bj1==0 && bj2==1) cout<<"lexicographically";	
	if(bj1==1 && bj2==0) cout<<"lengths";				 
    return 0;
}