#pragma oucGCC optimize(2)
#include<iostream>
#include<queue>
#include<cmath>
#include<vector>
#include<queue>
#include<cstring>
#include<algorithm>
#include<set>
#include<unordered_set>
#include<stack>
#include<map>
#include<unordered_map>
using namespace std;
long long  k, p, q, m, n;
const int maxn = 200005;
const long long inf = 0xfffffffffffff;
const int mod = 1e9 + 7;
int t;
string s;
struct Node {
	int x;
	int y;
};
bool cmp(Node a, Node b) {
	return a.x > b.x;
}
long long a[maxn];
vector<int>g[maxn];
long long cnt[maxn];
long long fact[maxn], infact[maxn];
long long qpow(long long a, long long b) {
	if (b < 0) return 0;
	long long ans = 1;
	a %= mod;
	while (b) {
		if (b & 1) ans = (ans * a) % mod;
		b >>= 1;
		a = (a * a) % mod;
	}
	return ans;
}
void init() {
	fact[0] = 1, infact[0] = 1;
	for (int i = 1; i < maxn; i++) {
		fact[i] = i * fact[i - 1] % mod;
		infact[i] = infact[i - 1] % mod * qpow(i, mod - 2) % mod;
	}
}
long long inv(long long n) {
	return qpow(n, mod - 2);
}
long long frac_mod(long long a, long long b) {
	return (a * inv(b) % mod) % mod;
}
long long nCr(long long n, long long r) {
	if (r > n || r < 0)
		return 0;
	if (n == r)
		return 1;
	if (r == 0)
		return 1;
	return (fact[n] * infact[r]) % mod * infact[n - r] % mod;
}
long long gcd(long long da, long long xiao) {
	while (xiao != 0) {
		long long temp = xiao;
		xiao = da % xiao;
		da = temp;
	}
	return(da);
}
long long dis[505][505];
long long d[505][505];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cin >> d[i][j];
			dis[i][j] = 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 (d[i][k] < inf && d[k][j] < inf)
					d[i][j] = min(d[i][k] + d[k][j], d[i][j]);
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			if (i == j) {
				cout << "0";
			}
			else {
				if (d[i][j] == dis[i][j])cout << "1";
				else cout << "0";
			}
		}
		cout << '\n';
	}
}