#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
const int inf = 1e9;

int n;
int d[105][105];

int main() {

	ifstream fin;
	fin.open("royfloyd.in");
	fin >> n;
	for (int i = 1; i <= n; i++) 
		for(int j = 1; j <= n; j++) {
			fin >> d[i][j];
		}
			
	fin.close();

	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++){
			if(i != j && d[i][j] == 0)
				d[i][j] = inf;
	}

	int i,j,k;
	for (k = 1; k <= n; k++)
		for(i = 1; i <= n; i++)
			for(j = 1; j <= n; j++)
				d[i][j] = min (d[i][j], d[i][k] + d[k][j]);

	ofstream fout;
	fout.open("royfloyd.out");
	
	for (i = 1; i <= n; i++) {
		for(j = 1; j <= n; j++)
			if(d[i][j] == inf) fout << "0 ";
			else fout << d[i][j] << " " ;
		fout << "\n";
	}
	fout.close();
	
	return 0;
}