import sys
input = sys.stdin.readline

class Node:
	def __init__(self):
		self.num = 0
		self.next = [None] * 2

class BinaryTrie:
	def __init__(self, d):
		self.root = Node()
		self.d = d

	def add(self, n):
		last = self.root
		for _ in [0] * self.d:
			i = n & 1
			if(last.next[i] is None):
				last.next[i] = Node()
			last = last.next[i]
			n >>= 1
		last.num += 1

	def search(self, n):
		last = self.root
		for _ in [0] * self.d:
			i = n & 1
			if(last.next[i] is None):
				return 0
			last = last.next[i]
			n >>= 1
		return last.num


n = int(input())
d = 50
user = []
trie = BinaryTrie(d)
for i in range(n):
	s = input().rstrip()
	lis = [0] * len(s)
	for i in range(len(s)):
		for j in range(len(s)):
			k = 26 if(i == j) else ord(s[j]) - ord('a')
			lis[i] = lis[i] * 27 + k
		trie.add(lis[i])
	user.append(lis)

for l in user:
	ans = 0
	for t in l:
		ans += trie.search(t) - 1
	print(ans)