def segfunc(x, y):
    return max(x, y)


class SegTree:
    def __init__(self, init_val, segfunc, ide_ele):
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        k += self.num
        self.tree[k] = x
        while k > 1:
            self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
            k >>= 1

    def query(self, l, r):
        res = self.ide_ele

        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.tree[r - 1])
            l >>= 1
            r >>= 1
        return res

    def get(self, k):
        return self.query(k, k+1)


N = int(input())
S = []
for i in range(N):
    s = list(map(lambda x: ord(x)-ord("a"), list(input())))
    t = sorted(s)
    if all(s[j] == t[j] for j in range(len(s))):
        S.append(s)
S.sort(key=lambda x: x[-1])
dp = SegTree([0]*26, segfunc, 0)

for i in range(len(S)):
    s = S[i][0]
    t = S[i][-1]
    n = len(S[i])
    dp.update(t, max(dp.query(0, s+1)+n, dp.get(t)))
print(dp.query(0, 27))