#include <bits/stdc++.h>

void Yes() {
    std::cout << "YES" << "\n";
    return;
}

void No() {
    std::cout << "NO" << "\n";
    return;
}

template<typename T>
void out(T x) { std::cout << x << "\n"; }

using namespace std;
using ll = long long;
using PII = pair<ll, ll>;

const ll N = 2e5 + 10;
ll dp[505][505];
ll ans[505][505];

void Solve() {
    ll n;
    cin >> n;
    for (ll i = 1; i <= n; i++) {
        for (ll j = 1; j <= n; j++) {
            cin >> dp[i][j], ans[i][j] = 1;
            if(i == j)
                ans[i][j] = 0;
        }
    }

    for (ll k = 1; k <= n; k++) {
        for (ll i = 1; i <= n; i++) {
            for (ll j = 1; j <= n; j++)
            {
                if (dp[i][k] + dp[k][j] < dp[i][j]) {
                    ans[i][j] = ans[j][i] = 0;
                    dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
                }
                if (dp[i][k] + dp[k][j] == dp[i][j] && (i!=k && j!=k)) {
                    ans[i][j] = ans[j][i] = 0;
                    dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
                }


            }
        }
    }
    for (ll i = 1; i <= n; i++) {
        for (ll j = 1; j <= n; j++) {
            cout<<ans[i][j];
        }
        cout<<"\n";
    }

}

signed main() {
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll t = 1;
//    cin>>t;
    while (t--)
        Solve();
}