L=list()
N=int(input())
for i in range(N):
  S=input()
  if len(S)==1:
    L.append((ord(S[0])-97,ord(S[-1])-97,1))
  for j in range(1,len(S)):
    if S[j-1]>S[j]:
      break
    if j==len(S)-1:
      L.append((ord(S[0])-97,ord(S[-1])-97,len(S)))
N=len(L)
L.sort()
#i番目までの数字でjで終わる奴の個数の最大dp[i][j]
dp=[[0]*26 for i in range(N+1)]
maxs=[[0]*26 for i in range(N+1)]
for i in range(1,N+1):
  a,b,c=L[i-1]
  for j in range(26):
    if j==b:
      dp[i][j]=max(dp[i-1][j],maxs[i-1][a]+c)
    else:
      dp[i][j]=dp[i-1][j]
    if j!=0:
      maxs[i][j]=max(maxs[i][j-1],dp[i][j])
    else:
      maxs[i][j]=dp[i][j]
print(max(dp[-1]))