from dataclasses import dataclass, field

N = int(input())
ans = 0

tri = lambda x: x * (x + 1) // 2


@dataclass
class TrieNode:
    num: int
    last: int
    seq: int
    child: dict = field(default_factory=dict)


G = [None] * (2 * 10 ** 5 + 1)
G[0] = TrieNode(num=0, last=0, seq=0)

nodenum = 1
for i in range(N):
    S = input()
    pointer = 0
    for s in S:
        if s not in G[pointer].child:
            G[pointer].child[s] = nodenum
            G[nodenum] = TrieNode(num=nodenum, last=i - 1, seq=0)
            nodenum += 1
        pointer = G[pointer].child[s]
        if G[pointer].last == i - 1:
            G[pointer].seq += 1
        else:
            G[pointer].seq = 1
        ans += tri(G[pointer].seq)
        G[pointer].last = i
print(ans)