n = int(input())
s = [input() for i in range(n)]

z = []
for i in range(n):
    b = True
    for j in range(len(s[i])-1):
        if s[i][j] > s[i][j+1]:
            b = False
            break
    if b:
        z.append((ord(s[i][0])-97,ord(s[i][-1])-97,len(s[i])))

z = sorted(z,key = lambda x:(x[1],x[0]))
m = len(z)
dp = [[0 for i in range(26)] for j in range(m+1)]
for i in range(m):
    for j in range(26):
        dp[i+1][j] = dp[i][j]
    for j in range(0,z[i][0]+1):
        dp[i+1][z[i][1]] = max(dp[i+1][z[i][1]],dp[i][j]+z[i][2])
print(max(dp[-1]))