#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

const int INF = 1001;

int n, v[102][102];

int main()
{

    fin>>n;

    for (int i=1; i<=n; i++) {
        for (int j=1; j<=n; j++) {

            fin>>v[i][j];

            if (i != j and v[i][j] == 0) {
                v[i][j] = INF;
            }

        }
    }

    for (int k=1; k<=n; k++) {
        for (int i=1; i<=n; i++) {
            for (int j=1; j<=n; j++) {
                v[i][j] = min(v[i][j], v[i][k] + v[k][j]);
            }
        }
    }

    for (int i=1; i<=n; i++) {
        for (int j=1; j<=n; j++) {

            if (i != j and v[i][j] == INF) {
                v[i][j] = 0;
            }

            fout<<v[i][j]<<" ";
        }
        fout<<"\n";
    }

    return 0;
}