The complete directed weighted graph is given with the weighted matrix. Construct a matrix of shortest paths between its vertices. It is guaranteed that the graph does not contain cycles of negative weight.
The first line contains the number of vertices n (1≤n≤100) in a graph. Each of the next n lines contains n numbers and describes the weighted matrix (the j-th number in the i-th row gives the weight of the edge from vertex i to vertex j). All the numbers by the absolute value do not exceed 100. The numbers on the main diagonal are always zero.
Print n rows with n numbers — the matrix of shortest distances between pairs of vertices. The j-th number of the i-th row must be equal to the weight of the shortest path from vertex i to vertex j.