import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

def main():
    N = int(input())
    S = set([])
    for i in range(N):
        S.add(str(input()))

    ans = []
    for s in S:
        temp = 0
        for i in range(len(s)):
            for j in range(26):
                if s[i] == chr(j+97): continue
                ns = s[:i] + chr(j+97) + s[i+1:]
                # print(ns)
                if ns in S:
                    # print(s,ns,i,j,chr(j+97))
                    temp += 1
        # print("temp",temp)
        ans.append(temp)
    print(*ans,sep="\n")
if __name__ == '__main__':
    main()