Number of pendant vertices 1#5080
A simple undirected unweighted graph is given. Find the number of pendant vertices. A vertex is called pendant if its degree is equal to .
The first line contains an integer n~(1 \le n \le 1000) — the number of vertices in the graph. The following lines contain the adjacency matrix.
Print the number of pendant vertices in the graph.
Example 1
Example 2