import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect
import string

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N = int(input())
S = [input()[:-1] for _ in range(N)]
A = [list(s) for s in S]

for i in range(N):
    ans = 0
    for j in range(len(S[i])):
        for c in string.ascii_lowercase:
            a = list(S[i])
            if a[j] == c:
                continue
            a[j] = c
            s = ''.join(a)
            if s in S:
                ans += 1
    print(ans)