#include <fstream>

#include <cstring>
using namespace std;

const int MAX_N = 102;

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

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

	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 && D[i][k] && D[k][j] && (D[i][k] + D[k][j] < D[i][j] || !D[i][j]))
                    D[i][j] = D[i][k] + D[k][j];

	for(int i = 1; i <= N; ++i) {
		for(int j = 1; j <= N; ++j)
			g << D[i][j] << " ";
		g << "\n";
	}

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

	return 0;
}