#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <ctime>
#include <unordered_map>
#include <iomanip>
#include <complex>
#include <cassert>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define deb(a) cerr<< #a << "= " << (a)<<"\n";

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long double ld;
typedef complex<double> base;
typedef vector<int> vi;
typedef pair<int,int> pii;

template<class T> ostream& operator<<(ostream& stream, const vector<T> v){ stream << "[ "; for (int i=0; i<(int)v.size(); i++) stream << v[i] << " "; stream << "]"; return stream; }
ll fpow(ll x, ll p, ll m){ll r=1; for (;p;p>>=1){ if (p&1) r=r*x%m; x=x*x%m; } return r;}
ll inv(ll a, ll b){ return a<2 ? a : ((a-inv(b%a,a))*b+1)/a%b; }
int gcd(int a, int b){ if (!b) return a; return gcd(b,a%b);}
ll gcd(ll a, ll b){ if (!b) return a; return gcd(b,a%b);}


int N,c[110][110];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	ifstream cin("royfloyd.in");
	ofstream cout("royfloyd.out");
	cin >> N;
	
	int i,j;
	for (i=1; i<=N; i++)
		for (j=1; j<=N; j++){
			cin >> c[i][j];
			if (c[i][j]==0 && i!=j)
				c[i][j]=-1;
		}
		
	
	for (int k=1; k<=N; k++)
		for (i=1; i<=N; i++)
			for (j=1; j<=N; j++)
				if (c[i][k]!=-1 && c[k][j]!=-1)
					c[i][j]=(c[i][j]==-1 ? c[i][k]+c[k][j] : min(c[i][j],c[i][k]+c[k][j]));
					
					
	for (i=1; i<=N; i++,cout << "\n")
		for (j=1; j<=N; j++)
			if (c[i][j]==-1) cout << 0 << " ";
			else cout << c[i][j] << " ";
	
}