#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)

# _INPUT = """3
# ab
# cd
# f
# """
# sys.stdin = io.StringIO(_INPUT)


N = int(input())
S = [input()for _ in range(N)]

dp = [0] * 26
for s in S:
    
    ok = True
    for i in range(len(s)-1):
        if s[i] > s[i+1]:
            ok = False
            break
    if not ok:
        continue

    dp1 = [0] * 26
    k1 = ord(s[0])-ord('a')
    k2 = ord(s[-1])-ord('a')
    for k in range(k1+1):
        dp1[k] = max(dp1[k], dp[k])
        dp1[k2] = max(dp1[k2], dp[k]+len(s))
    dp = dp1

ans = max(dp)
print(ans)