connected_components_dfs

def dfs(node, graph, visited, connected):
    if node in visited:
        return
    visited.add(node)
    for child in graph[node]:
        dfs(child, graph, visited, connected)
    connected.append(node)


n = int(input())
graph = []
visited = set()


for _ in range(n):
    graph.append([int(x) for x in input().split()])

for node in range(n):
    if node in visited:
        continue
    connected = []
    dfs(node, graph, visited, connected)

    print(f'Connected component:', *connected)