#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define ld long double
#define endl "\n"
 
const int Nmax = 110;
const int MODULO = 1e9 + 7;
const int oo = -1e9;

int a[Nmax][Nmax];
int v[Nmax][Nmax];

void solve() {
	int n; cin >> n;
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) {
			cin >> a[i][j];
		}
	}

	for(int k = 1; k <= n; k++) {
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= n; j++) {
				// vad daca e mai bn drum de la i la j prin k
				if(a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0) && i != j && i != k && j != k && a[i][k] && a[k][j]) {
					a[i][j] = a[i][k] + a[k][j];
				}
			}
		}
	}

	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) {
			cout << a[i][j] << " ";
		}
		cout << endl;
	}
}
	
void fisier() {
	freopen("royfloyd.in" , "r", stdin);
	freopen("royfloyd.out", "w", stdout);
}

 
int main() {
	ios_base::sync_with_stdio(0);
 
	cin .tie(0);
	cout.tie(0);

	fisier();
 
	int testCases = 1;
	//cin >> testCases;
	while(testCases--) {
		solve();
	}
}