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