#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
#include <utility>
#include <fstream>
#include <climits>

using namespace std;

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

const int INF = INT_MAX;


int distanta[101][101];

int main() {
	int n;
	fin >> n;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			fin >> distanta[i][j];
			if (distanta[i][j] == 0 && i != j) {
				distanta[i][j] = INF;
			}
		}
	}

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

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			if (distanta[i][j] == INF) {
				fout << 0 << " ";
			}
			else {
				fout << distanta[i][j] << " ";
			}
		}
		fout << "\n";
	}


	return 0;
}