Развернутый граф

n = int(input())
arr = []
k = 0
graph = [[0] * n for i in range(n)]
for i in range(n):
    for j in list(map(int, input().split())):
        graph[i][j - 1] = 1
#for k in graph:
    #print(' '.join(map(str, k)))
 
for i in range(n):
    for j in range(n):
        if '*' not in str(graph[i][j]) and '*' not in str(graph[j][i]):
            graph[i][j], graph[j][i] = graph[j][i], graph[i][j]
            graph[i][j] = str(graph[i][j]) + '*'
            graph[j][i] = str(graph[j][i]) + '*'
#print('-------------------')
for i in range(n):
    for j in range(n):
        if '*' in graph[i][j]:
            graph[i][j] = str(graph[i][j]).replace('*', '')
        if '**' in graph[i][j]:
            graph[i][j] = str(graph[i][j]).replace('**', '')
for i in range(n):
    for j in range(n):
        graph[i][j] = int(graph[i][j])
#for k in graph:
    #print(' '.join(map(str, k)))
#print('----------------')
print(n)
for k in graph:
    if len(set(k)) == 1 and 0 in k:
        print('')
        continue
    else:
        for j in range(len(k)):
            if k[j] == 1:
                arr.append(j + 1)
        arr.sort()
        print(*arr)
        arr.clear()

from collections import defaultdict
 
n = int(input())
graph = {}
for i in range(n):
    graph[i+1] = list(map(int,input().split()))
    
reverse_graph = defaultdict(list)
for vert,edges in graph.items():
    for e in edges:
        reverse_graph[e].append(vert)
        
print(n)
for i in range(n):
    print(*sorted(reverse_graph[i+1]))