Find the transitive closure of the directed graph.
The directed graph is given with the list of edges. The first line contains the number of vertices n (1≤n≤100). Each of the next lines contains two vertices a and b (1≤a,b≤n) describing the directed edge from a to b.
Print the adjacency matrix of the transitive closure of the directed graph.