Given a simple undirected unweighted graph. Count the number of hanging vertices in it. The vertex is hanging, if its degree is 1.
The first line contains number n (1≤n≤1000). The next n lines contain the adjacency matrix.
Print the number of hanging vertices in a graph.