From adjacency matrix to adjacency list

Input

The first line contains the number n~(1 \le n \le 100) of vertices in the graph. Each of the following $n$ lines contains $n$ integers — the adjacency matrix. It is guaranteed that the graph has no self-loops.

Output

Print $n$ lines — the adjacency list of the graph. In the $i$-th line, first print the number of edges going out from vertex $i$, followed by the numbers of the vertices they point to, in ascending order.

Examples