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 two numbers n and m (1 ≤ n, m ≤ 1000) - the number of vertices and the number of edges. Next m lines contain a list of edges.
Print the number of hanging vertices in a graph.