# #    ⋀_⋀  #   (・ω・) # ./ U ∽ U\ # │* 合 *│ # │* 格 *│ # │* 祈 *│ # │* 願 *│ # │*   *│ #  ̄ # import sys sys.setrecursionlimit(10**6) input=sys.stdin.readline from math import floor,ceil,sqrt,factorial,hypot,log #log2ないyp from heapq import heappop, heappush, heappushpop from collections import Counter,defaultdict,deque from itertools import accumulate,permutations,combinations,product,combinations_with_replacement from bisect import bisect_left,bisect_right from copy import deepcopy inf=float('inf') mod = 10**9+7 def pprint(*A): for a in A: print(*a,sep='\n') def INT_(n): return int(n)-1 def MI(): return map(int,input().split()) def MF(): return map(float, input().split()) def MI_(): return map(INT_,input().split()) def LI(): return list(MI()) def LI_(): return [int(x) - 1 for x in input().split()] def LF(): return list(MF()) def LIN(n:int): return [I() for _ in range(n)] def LLIN(n: int): return [LI() for _ in range(n)] def LLIN_(n: int): return [LI_() for _ in range(n)] def LLI(): return [list(map(int, l.split() )) for l in input()] def I(): return int(input()) def F(): return float(input()) def ST(): return input().replace('\n', '') class RollingHash: def __init__(self,S): self.mod1 = 2**61-1 self.base1 = 1007 self.hash1 = [0]*(len(S)+1) for i,s in enumerate(S,start=1): self.hash1[i] = (self.hash1[i-1] * self.base1 + ord(s)) % self.mod1 #S[l:r]のハッシュを取得する def get_hash(self,l,r): if r-l<0: print("rlen(S): break cnt[RH.get_hash(l,r)] += 1 # print(cnt) M=I() ans = 0 for _ in range(M): s = ST() h = RollingHash(s).get_hash(0,len(s)) # print(cnt[h]) ans += cnt[h] print(ans) if __name__ == '__main__': main()