def check(x):
    n = len(x)
    for i in range(n-1):
        if x[i] > x[i+1]:
            return False
    return True


n = int(input())
L = []
for i in range(n):
    s = str(input())
    if check(s):
        first = ord(s[0]) - 97
        last = ord(s[-1]) - 97
        L.append((first,last,len(s)))
L.sort()
#print(L)

dp = [0]*26
for first, last, length in L:
    dp[last] = max(dp[last], max(dp[:first+1]) + length)
#print(dp)
ans = max(dp)
print(ans)