You are given a simple undirected unweighted graph. Your task is to determine the degree of each vertex.
The first line contains the integer (1 \leq N \leq 1000), representing the number of vertices. The following lines provide the adjacency matrix of the graph.
Output integers, each representing the degree of a vertex.
1-nji mysal