Degrees of vertices
Execution time limit is 1 second
Runtime memory usage limit is 64 megabytes
You are given a simple undirected unweighted graph. Your task is to determine the degree of each vertex.
Input
The first line contains the integer N (1 ≤ N ≤ 1000), representing the number of vertices. The following N lines provide the adjacency matrix of the graph.
Output
Output N integers, each representing the degree of a vertex.
Examples
Input #1
Answer #1
Submissions 2K
Acceptance rate 58%