n = int(input())


def f(s):
    b = [[] for _ in range(26)]
    for i in range(len(s)-1,-1,-1):
        b[ord(s[i]) - 97].append(i)
    for i in range(len(s)   ):
        for j in range(ord(s[i]) - 97):
            if len(b[j]) > 0:
                s = list(s)
                s[i], s[b[j][0]] = s[b[j][0]], s[i]
                return "".join(s)
        b[ord(s[i]) - 97].pop()
    for j in range(26):
        if s.count(chr(j+97)) >= 2:
            return s
    s = list(s)
    s[-1], s[-2] = s[-2], s[-1]
    return "".join(s)

s = [input() for _ in range(n)]
z = []
a = chr(97+26)

for i in range(n):
    s[i] = f(s[i])
    #print(s[i])
    a = min(a, s[i])

c = s.count(a)

for i in range(n):
    #print(s[i])
    if s[i] == a:
        print(n+1-c)
    else:
        print(0)