import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

def isbad(s):
    for i in range(len(s)-1):
        if s[i] > s[i+1]: return True
    return False

n = II()
to = [[] for _ in range(27)]
loop = [0]*26
for _ in range(n):
    s = BI()
    if isbad(s): continue
    u = s[0]-97
    v = s[-1]-97
    c = len(s)
    if u == v:
        loop[u] += c
    else:
        to[u].append((v, c))

dp = [0]*27
for u in range(26):
    dp[u] += loop[u]
    dp[u+1] = max(dp[u+1], dp[u])
    for v, c in to[u]:
        dp[v] = max(dp[v], dp[u]+c)

print(dp[-1])