#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 500 + 10;
int inf = 1e9;
int n;
int a[maxn][maxn], dis[maxn][maxn];
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            cin >> a[i][j];
            dis[i][j] = 1e9;
        }
    }
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                dis[i][j] = min(dis[i][j], min(dis[i][k], a[i][k])+min(dis[k][j], a[k][j]));
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
            cout << ((a[i][j]<=dis[i][j])&(i!=j));
            // cout << dis[i][j] << " ";
        cout << "\n";
    }
    cout << flush;
}
signed main()
{
    // ios::sync_with_stdio(0); cin.tie(0);
    int TT = 1;
    while (TT--)
    {
        solve();
    }
    return 0;
}