n = int(input())

def is_good(s):
    for i in range(1, len(s)):
        if s[i] < s[i-1]:
            return False
    return True

good = []
for _ in range(n):
    s = input().strip()
    if is_good(s):
        first = ord(s[0])
        last = ord(s[-1])
        good.append((first, last, len(s)))

# Initialize dp array
dp = [-float('inf')] * 123
dp[0] = 0  # Virtual character at ASCII 0

max_dp = [0] * 123

# Initialize max_dp
max_so_far = -float('inf')
for c in range(123):
    max_so_far = max(max_so_far, dp[c])
    max_dp[c] = max_so_far

for f, l, length in good:
    current_max = max_dp[f]
    candidate = current_max + length
    if candidate > dp[l]:
        dp[l] = candidate
    # Update max_dp after updating dp
    max_so_far = -float('inf')
    for c in range(123):
        max_so_far = max(max_so_far, dp[c])
        max_dp[c] = max_so_far

ans = max(dp)
print(max(ans, 0))