import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
#from math import isqrt, prod,comb  # python3.8用(notpypy)
#from bisect import bisect_left,bisect_right
#from functools import lru_cache,reduce
#from heapq import heappush,heappop,heapify,heappushpop,heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError
#numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)


def main():
    mod = 10**9+7
    mod2 = 998244353
    n=int(input())
    ans=0
    check=defaultdict(lambda:0)
    for i in range(n):
        s=list(input())
        if s==sorted(s):
            if s[0]==s[-1]:
                check[(s[0],s[-1])]+=len(s)
            else:
                check[(s[0],s[-1])]=max(check[(s[0],s[-1])],len(s))
    """
    for a2 in range(1,26):
        for c2 in range(27):
            for b2 in range(a2+1):
                a,b,c=map(lambda x:chr(x+97),[c2,c2+b2,c2+a2])
                check[(a,c)]=max(check[(a,c)],check[(a,b)]+check[(b,c)])
    print(ans+check[('a','z')])
    #print(check[('a','d')])
    """
    dp=[0]*26
    for a in range(26):
        aa=chr(a+97)
        for b in range(a):
            bb=chr(b+97)
            dp[a]=max(dp[a],dp[b]+check[(bb,aa)])
        dp[a]+=check[(aa,aa)]
    print(dp[-1])



if __name__ == '__main__':
    main()