Half-powers of vertices

You are given a directed graph represented by an adjacency matrix. Your task is to determine the in-degree and out-degree for each vertex in the graph. The in-degree is the number of edges coming into a vertex, while the out-degree is the number of edges going out from a vertex.

Input Data

• N: The number of vertices in the graph (1 ≤ N ≤ 100).

• An adjacency matrix consisting of N rows, each containing N numbers, where each number is either 0 or 1.

Output Data

For each vertex, output a pair of numbers: the in-degree followed by the out-degree. Provide these pairs for all N vertices.

Examples