#include<bits/stdc++.h>
using namespace std;
const int N=10000;
int to[N],nextn[N],head[N],w[N],num;
int vis[N],ans,dp[N]={-1};
string s[N];
vector<int>v[N];
int dfs(int x)
{
	if(dp[x]!=-1) return dp[x];
	int l=s[x].length();
	int max_path=l;
	int t=s[x][l-1]-'A'+1;
	for(int i=0;i<v[t].size();i++)
	{
		int y=v[t][i];
		if(!vis[y])
		{
			vis[y]=1;
			max_path=max(max_path,l+dfs(y));
			vis[y]=0;
		}
	}
	dp[x]=max_path;
	return max_path;
}

int main()
{
	for(int i=1;i<N;i++) dp[i]=-1;
	int n;
	scanf("%d",&n);
	string ss;
	for(int i=1;i<=n;i++)
	{
		cin>>ss;
		s[i]=ss;
		v[ss[0]-'A'+1].push_back(i);
	}
	for(int i=1;i<=n;i++)
	{
		vis[i]=1;
		ans=max(ans,dfs(i));
		vis[i]=0;
	}
	printf("%d",ans);
	return 0;
	
}