n = int(input())
filtered = []

for _ in range(n):
    s = input().strip()
    good = True
    for i in range(1, len(s)):
        if s[i] < s[i-1]:
            good = False
            break
    if good:
        f_char = s[0]
        l_char = s[-1]
        filtered.append((f_char, l_char, len(s)))

dp = [0] * 26
max_prefix = [0] * 26

for f_char, l_char, length in filtered:
    f = ord(f_char) - ord('a')
    l = ord(l_char) - ord('a')
    current_max_prev = max_prefix[f] if f >= 0 else 0
    candidate = current_max_prev + length
    if candidate > dp[l]:
        dp[l] = candidate
        # Recompute max_prefix
        current_max = dp[0]
        max_prefix[0] = current_max
        for i in range(1, 26):
            current_max = max(current_max, dp[i])
            max_prefix[i] = current_max

print(max(dp))