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

n = int(input())
good_strings = []
for _ in range(n):
    s = input().strip()
    if is_good(s):
        start = s[0]
        end = s[-1]
        good_strings.append((start, end, len(s)))

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

for start_char, end_char, length in good_strings:
    start_idx = ord(start_char) - ord('a')
    end_idx = ord(end_char) - ord('a')
    current_max_prev = max_dp[start_idx]
    new_val = current_max_prev + length
    if new_val > dp[end_idx]:
        dp[end_idx] = new_val
    # 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(max_dp))