#include <fstream>

#include <cstring>
using namespace std;

const int MAX_N = 102;
const int INF = 0x3f3f3f3f;

int N;
int D[MAX_N][MAX_N];

int main() {
	ifstream f("royfloyd.in");
	ofstream g("royfloyd.out");


	memset(D, INF, sizeof(D));

	f >> N;
	for(int i = 1; i <= N; ++i)
		for(int j = 1; j <= N; ++j)
			f >> D[i][j];	
	
	for(int k = 1; k <= N; ++k)
		for(int i = 1; i <= N; ++i)
			for(int j = 1; j <= N; ++j)
				if(i != j && i != k && j != k)
					D[i][j] = min(D[i][j], D[i][k] + D[k][j]);
	
	for(int i = 1; i <= N; ++i) {
		for(int j = 1; j <= N; ++j) {
			if(D[i][j] == INF)
				D[i][j] = 0;
			g << D[i][j] << " ";
		}	
		g << "\n";
	}

	f.close();
	g.close();

	return 0;
}