// https://goo.gl/fBmFxu
#include <bits/stdc++.h>

using namespace std;

#define NMAX 1000
#define MMAX 200009
#define kInf (1 << 30)
#define kInfLL (1LL << 60)
#define kMod 666013
#define edge pair<int, int>
#define x first
#define c second

#define USE_FILES "MLC"

#ifdef USE_FILES
#define cin fin
#define cout fout
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#endif


// number of tests from "in"
int test_cnt = 1;
void clean_test();

// your global variables are here


// your solution is here

int n;
vector<vector<int>>d;

void royfloyd(vector<vector<int>>&d) {
    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] && d[k][j]) {
                    if (i != j) {
                        if (d[i][k] + d[k][j] < d[i][j] || d[i][j] == 0) {
                            d[i][j] = d[i][k] + d[k][j];
                        }
                    }
                }
            }
        }
    }
}

void solve() {

    cin >> n;
    d = vector<vector<int>>(n + 1, vector<int>(n+1));
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
             cin >> d[i][j];
        }
    }

    royfloyd(d);

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

}


void clean_test() {
    // clean if needed
    for (int i = 1; i <= n; ++i) {
            d[i].clear();
        }
}

int main() {

    //cin >> test_cnt;

    while (test_cnt--) {
        solve();
    }

    return 0;
}