#include <bits/stdc++.h>
#include <fstream>
#define ll long long
#define pb push_back
#define F first
#define S second
#define endl '\n'
#define all(a) (a).begin(),(a).end()
using namespace std;
const int maxn = 1e3 + 5;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

ll min(ll a, ll b) {
    if (a < b) return a;
    return b;
}

void floyd_warshall(vector<vector<ll>>& a, int n) {
    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) {
                    a[i][j] = a[i][k] + a[k][j];
                }
            }
        }
    }
}



void solve() {
    int n;
    fin >> n;
    vector<vector<ll>> a(maxn, vector<ll>(maxn, 0));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            fin >> a[i][j];
        }
    }
    floyd_warshall(a, n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
                fout << a[i][j] << " ";
        }
        fout << endl;
    }
}
 
int main() {
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}