The simple oriented graph is given by the adjacency matrix. Print its representation as a list of edges.
The first line contains number of vertices (1 \le n \le 100) in the graph. Each of the next lines contains elements – the description of adjacency matrix.
Print the list of edges, ordered first by the first vertex in a pair that describes an edge, then by the second vertex.
Example 1