n = int(input())
dp = [0] * 26
g = [[] for _ in range(26)]
k = [0] * 26
for i in range(n):
    s = input()
    if sorted(s) == list(s):
        if s[0] == s[-1]:
            k[ord(s[0]) - 97] += len(s)
        else:
            g[ord(s[0]) - 97].append((ord(s[-1]) - 97, len(s)))
for i in range(25):
    dp[i] += k[i]
    for j, c in g[i]:
        dp[j] = max(dp[j], dp[i] + c)
    dp[i + 1] = max(dp[i + 1], dp[i])
print(dp[-1] + k[-1])