Анаграммы

a, c = [input().lower() for _ in range(int(input()))], []
for i in a:
    b = [j for j in a if sorted(i) == sorted(j)]
    if len(b) > 1:
        c.append(b)
        for p in range(len([j for j in a if sorted(i) == sorted(j) and i != j])):
            del a[p]
print(*sorted([' '.join(sorted(i)) for i in c]), sep='\n')

from collections import defaultdict
 
comb = defaultdict(list)
words_count = int(input())
for _ in range(words_count):
    word = input().lower()
    comb[str(set(word))].append(word)
for a_list in comb.values():
    print(' '.join(sorted(a_list)))

from collections import defaultdict
 
comb = defaultdict(list)
words_count = int(input())
for _ in range(words_count):
    word = input().lower()
    comb[str(set(word))].append(word)
for a_list in comb.values():
    if len(a_list) == 1:
        continue
    print(' '.join(sorted(a_list)))

from collections import defaultdict
 
comb = defaultdict(list)
words_count = int(input())
for _ in range(words_count):
    word = input().lower()
    comb[tuple(sorted(word))].append(word)
all_ = tuple(comb.values())
del comb
for a_list in all_:
    print(' '.join(sorted(a_list)))

a = [input().lower() for _ in range(int(input()))]
a.sort()
i = len(a)-1
while i > 0:
    if a[i] == a[i-1]:
        del a[i]
    i -= 1
b = [''.join(sorted(w)) for w in a]
i = 0
while i < len(a) - 1:
    s = [a[i]]
    j = i + 1
    while j < len(a):
        if b[j] == b[i]:
            s.append(a[j])
            del a[j]
            del b[j]
            j -= 1
        j += 1
    if len(s) > 1:
        print(*s, sep=" ")
    i += 1

from collections import defaultdict
 
comb = defaultdict(list)
words_count = int(input())
for _ in range(words_count):
    word = input().lower()
    comb[tuple(sorted(word))].append(word)
all_ = tuple(comb.values())
del comb
[print(' '.join(sorted(a_list))) for a_list in all_]

from collections import defaultdict
 
comb = defaultdict(list)
words_count = int(input())
for _ in range(words_count):
    word = input().lower()
    comb[tuple(sorted(word))].append(word)
[print(' '.join(sorted(a_list))) for a_list in comb.values()]

n = int(input())
d = {}
print(n)
for i in range(n):
    w = input().lower()
    s = ''.join(sorted(w))
    wl = d.get(s)
    if wl:
        wl.append(w)
    else:
       d[s] = [w]
for k in d.keys():
    if len(d[k]) > 1:
        d[k].sort()
        print(*d[k])

comb = []
words_count = int(input())
for _ in range(words_count):
    word = input().lower()
    for a_list in comb:
        if set(a_list[0]) == set(word):
            a_list.append(word)
            a_list.sort()
            word = None
            break
    if word:
        comb.append([word])
comb.sort(key=lambda x: x[0])
[print(' '.join(a_l)) for a_l in comb]

n = int(input())
d = {}
print(n)
for i in range(n):
    w = input().lower()
    s = ''.join(sorted(w))
    wl = d.get(s)
    if wl:
        wl.append(w)
    else:
       d[s] = [w]
out =[]
for k in d.keys():
    if len(d[k]) > 1:
        d[k].sort()
        out.append(' '.join(d[k]))
out.sort()
print(*out, sep="\n")

comb = []
words_count = int(input())
for _ in range(words_count):
    word = input().lower()
    for a_list in comb:
        if set(a_list[0]) == set(word):
            a_list.append(word)
            word = None
            break
    if word:
        comb.append([word])
[a_l.sort() for a_l in comb]
comb.sort(key=lambda x: x[0])
[print(' '.join(a_l)) for a_l in comb]