Anagrams

n = int(input())

groups = {}
alones = {}
alphabet = {
    "a": 0, "b": 1, "c": 2, "d": 3, "e": 4,
    "f": 5, "g": 6, "h": 7, "i": 8, "j": 9,
    "k": 10, "l": 11, "m": 12, "n": 13, "o": 14,
    "p": 15, "q": 16, "r": 17, "s": 18, "t": 19,
    "u": 20, "v": 21, "w": 22, "x": 23, "y": 24, "z": 25
}
primes = [
    2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
    73, 79, 83, 89, 97, 101
]

modulo = 2**63-1

for i in range(n):
    word = input()
    
    h = 1
    for c in word:
        h = h * primes[alphabet[c]] % modulo

    if h not in alones:
        alones[h] = word
    else:
        if h not in groups:
            groups[h] = [alones[h]]
        groups[h].append(word)

print(len(groups))
for group, elements in groups.items():
    print(len(elements))
    print("\n".join(elements))

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED