The undirected unweighted graph is given. Find the number of its connected components. \InputFile The first line contains the number of vertices $n\:(n \le 100)$ in the graph. Then, in $n$ lines, an $n$ by $n$ matrix is given --- the adjacency matrix of the graph. In the $i$-th row, at the $j$-th position, there is a $1$ if vertices $i$ and $j$ are connected by an edge, and $0$ if there is no edge between them. The main diagonal of the matrix contains zeroes. The matrix is symmetric with respect to the main diagonal. \OutputFile Print the number of connected components in a graph. \includegraphics{https://static.e-olymp.com/content/55/557b6326cb14d307dd67dfa6f952574cb6f8e559.gif}