N=int(input())
DP=[[0 for _ in range(26)] for _ in range(N+1)]
for i in range(N):
  S=input()
  flg=True
  for k in range(26):
    DP[i+1][k]=DP[i][k]
  if len(S)!=1:
    for j in range(len(S)-1):
      if S[j+1]<S[j]:
        flg=False
  if flg:
    s=S[0]
    g=S[-1]
    DP[i+1][ord(g)-97]=max(DP[i][:ord(s)-96])+len(S)
print(max(DP[N]))