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

for _ in range(n):
    s = input().strip()
    is_good = True
    for i in range(1, len(s)):
        if s[i] < s[i-1]:
            is_good = False
            break
    if is_good and len(s) > 0:
        start = s[0]
        end = s[-1]
        length = len(s)
        good_strings.append((start, end, length))

dp = [0] * 26
max_dp = [0] * 26

for start_char, end_char, l in good_strings:
    s0 = ord(start_char) - ord('a')
    sn = ord(end_char) - ord('a')
    current_max_prev = max_dp[s0]
    candidate = current_max_prev + l
    if candidate > dp[sn]:
        dp[sn] = candidate
    # Update max_dp
    current_max = 0
    for i in range(26):
        if dp[i] > current_max:
            current_max = dp[i]
        max_dp[i] = current_max

print(max_dp[-1])