#pragma GCC optimize("03")
#include <bits/stdc++.h>
#define N 110

using namespace std;

ifstream in("royfloyd.in");
ofstream out("royfloyd.out");

int n, dp[N][N];

int main(){
	in >> n;
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			in >> dp[i][j];
	for(int k = 1; k <= n; k++)
		for(int i = 1; i <= n; i++)
			for(int j = 1; j <= n; j++)
				if(dp[i][k] && dp[k][j] && (dp[i][j] == 0 || dp[i][k] + dp[k][j] < dp[i][j]))
					dp[i][j] = dp[i][k] + dp[k][j];
	for(int i = 1; i <= n; i++, out << '\n')
		for(int j = 1; j <= n; j++)
			out << dp[i][j] << ' ';
	return 0;
}