# pragma GCC optimize("Ofast")
# pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,a,b) for (int i = a; i <= b; i++)
#define fi(i,a,b) for (int i = a; i < b; i++)
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define rc(s) return cout<<s,0
#define er erase
#define in insert
#define pi pair <int, int>
#define pii pair <pi, pi>
# define sz(x) (int)((x).size())

int n,k,a[105][105];

int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
	cin>>n;
	forn(i,1,n)forn(j,1,n){
		cin>>a[i][j];
	}
	forn(k,1,n)forn(i,1,n)forn(j,1,n){
		if(i!=j && a[i][k] && a[k][j] && !a[i][j])a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
	} 
	forn(i,1,n){
		cout<<'\n';
	forn(j,1,n){
		cout<<a[i][j]<<' ';
	}
}
return 0;
}