//(ᗜ ˰ ᗜ)
// #define NDEBUG
#include <bits/stdc++.h>
using namespace std;
namespace LING
{
#ifdef ONLINE_JUDGE
#define DBG(...) ;
#define dbg(...) ;
#else
#define DBG(x) cout << "! " << #x << " = " << x << endl
#include "debug.h"
#endif
    using ll = long long;
    using db = double;
#define SPO(x) fixed << setprecision(x)
#define FOR(i, l, r) for (ll i = l; i <= (r); ++i)
#define ROF(i, r, l) for (ll i = r; i >= (l); --i)
#define edl '\n'
#define fir first
#define sec second
#define str string
#define pll pair<ll, ll>
#define heap priority_queue
    // constexpr db PI = acos(-1.0);
    // constexpr db EPS = 1.0e-9;
    constexpr long long LNF = 0x3f3f3f3f3f3f3f3fLL;
    constexpr int INF = 0x3f3f3f3f;
    constexpr long long MOD = 998244353;
    constexpr ll MXN = 5e2 + 5;
    ll KSM(ll base, ll exp, ll MOD)
    {
        ll res = 1;
        base %= MOD;
        while (exp)
        {
            if (exp & 1)
                res = (res * base) % MOD;
            base = (base * base) % MOD;
            exp >>= 1;
        }
        return res;
    }
}
using namespace LING;
ll n;
ll a[MXN][MXN];
ll f[MXN][MXN];
void Solve(void)
{
    cin >> n;
    FOR(i, 1, n)
    FOR(j, 1, n)
    {
        if (i != j)
            f[i][j] = LNF;
    }
    FOR(i, 1, n)
    FOR(j, 1, n)
    {
        cin >> a[i][j];
        f[i][j] = min(f[i][j], a[i][j]);
    }
    FOR(k, 1, n)
    FOR(i, 1, n)
    FOR(j, 1, n)
    f[i][j] = min(f[i][j], f[i][k] + f[k][j]);

    FOR(i, 1, n)
    {
        FOR(j, 1, n)
        {
            if (i != j && a[i][j] == f[i][j])
                cout << 1;
            else
                cout << 0;
        }
        cout << edl;
    }
    return;
}
int main(void)
{
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    // #ifndef ONLINE_JUDGE
    // freopen("cin.txt","r",stdin);
    // freopen("cout.txt","w",stdout);
    // #endif

    int t = 1;
    // cin >> t;
    while (t--)
        Solve();
    return 0;
}