/**
    Frățeanu Iustin-Alexandru
    397916YC
**/
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned long long;
///using i128 = __int128_t;
///using ui128 = __uint128_t;
using sint = short int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpi = vector<pii>;
using vpl = vector<pll>;
template<typename T>
using vvector = vector<vector<T>>;
template<typename K, typename V, typename H = std::hash<K>>
using umap = unordered_map<K, V, H>;
template<typename T, typename H = std::hash<T>>
using uset = unordered_set<T, H>;
template<typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename A, typename B>
using vp = vector<pair<A, B>>;
#define FAST ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define FILES(k) freopen(k".in", "r", stdin); freopen(k".out", "w", stdout);
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define al(v, st, dr) begin(v) + st, begin(v) + dr
#define ral(v, st, dr) rbegin(v) + st, rbegin(v) + dr
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ef emplace_front
#define pob pop_back
#define pof pop_front
#define fs first
#define sd second
#define inf 0x7f7f7f7f
#define infll 0xfffffffffffffff
#define sz(v) (int)v.size()

signed main() {
    FAST
    FILES("roy-floyd")
        
    int n;
    cin >> n;
    vvector<int> a(n + 1, vector<int>(n + 1, -1)), p(n + 1, vector<int>(n + 1, 0));

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            cin >> a[i][j];

            if (a[i][j] == 0) {
                a[i][j] = -1;
            }
        }
    }

    for (int i = 1; i <= n; ++i) {
        a[i][i] = 0;
    }
    
    for (int k = 1; k <= n; ++k) {
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= n; ++j) {
                if (a[i][k] != -1 && a[k][j] != -1 && (a[i][j] == -1 || a[i][j] > a[i][k] + a[k][j])) {
                    a[i][j] = a[i][k] + a[k][j];
                    p[i][j] = p[k][j];
                }
            }
        }
    }
    
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            cout << a[i][j] << " \n"[j == n];
        }
    }
/**
    function<void(int, int)> drum = [&](int par, int x) {
        if (par != x) {
            drum(par, p[par][x]);
        }
        
        cerr << x << " ";
    };
    
    cerr << "Drumuri: \n";
    int cnt = 0;
    vector<int> c;
    
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (a[i][j] <= 0) {
                continue;
            }
            
            cerr << ++cnt << ") drumul minim de la " << i << " la " << j << ": ";
            drum(i, j);
            cerr << "\n";
        }
    }
**/
}