#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = (int)1e5+5;
const int bs = 37, p1 = 998244353, p2 = (int)1e9+7;
int n,len[maxn],lst[maxn]; string s[maxn]; unordered_map<ll,int> mp;
bool cmp(int X,int Y){return len[X]<len[Y];}
ll get_hs(int idx,int l,int r){
	ll hs1 = 0, hs2 = 0;
	for(int al=l;al<=r;al++){
		hs1 = hs1*bs%p1, hs2 = hs2*bs%p2;
		hs1 = (hs1+s[idx][al]-'a'+1)%p1,
		hs2 = (hs2+s[idx][al]-'a'+1)%p2;
	}
	return (hs1<<32)|hs2;
}
int main(){
	ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
	cin >> n;
	for(int al=1;al<=n;al++) cin >> s[al], len[al] = s[al].length(), lst[al] = al;
	sort(lst+1,lst+n+1,cmp);
	int ans = 0;
	for(int al=1;al<=n;al++)
		if(len[lst[al]]==1) mp.insert(make_pair(get_hs(lst[al],0,len[lst[al]]-1),1)), ans = 1;
		else{
			ll hs1 = get_hs(lst[al],0,len[lst[al]]-2);
			ll hs2 = get_hs(lst[al],1,len[lst[al]]-1);
			if(mp.count(hs1) && mp.count(hs2))
				mp.insert(make_pair(get_hs(lst[al],0,len[lst[al]]-1),1)), ans = len[lst[al]];
		} 
	cout << ans << endl;
	return 0;
}