#include <bits/stdc++.h>

using namespace std;

const int NMAX = 100;
const int INF = 1e9;
int d[NMAX + 1][NMAX + 1];

int main()
{
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");
    int n;
    f >> n;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            f >> d[i][j];
            if(i != j && d[i][j] == 0) {
                d[i][j] = INF;
            }
        }
    }
    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] < d[i][j]) {
                    d[i][j] = d[i][k] + d[k][j];
                }
            }
        }
        //d[i][j] la pasul k = distanta minima de la i la j
        //daca drumul dintre i si j ar avea noduri intermediare
        //doar din multimea {1, 2, ..., k}.
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            if(d[i][j] == INF) {
                d[i][j] = 0;
            }
            g << d[i][j] << ' ';
        }
        g << '\n';
    }
    return 0;
}