Sources and sinks#3986
A vertex of a directed graph is called a source if no edge enters it, and a sink if no edge leaves it.
You are given a directed graph as an adjacency matrix. Find all of its source vertices and all of its sink vertices.
The first line contains the number of vertices in the graph (1 \le n \le 100), followed by the adjacency matrix: lines, each containing numbers, each number is either or .
Print on the first line the number of sources in the graph, followed by the numbers of the source vertices in increasing order. On the second line, print similar information about the sinks, in the same format.
Example 1