#include <fstream>
#include <algorithm>

using namespace std;

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

const int MAX_N = 100;
const int INF = 0x3fffffff;

int A[1 + MAX_N][1 + MAX_N];

int main() {
    int n, i, j, k;

    in >> n;
    for(i = 1; i <= n; i++) {
        for(j = 1; j <= n; j++) {
            in >> A[i][j];
            if (A[i][j] == 0)
                A[i][j] = INF;
        }
    }

    for (k = 1; k <= n; k++) {
        for (i = 1; i <= n; i++) {
            for (j = 1; j <= n; j++) {
                if (i != k && j != k && i != j) {
                    if (A[i][j] > A[i][k] + A[k][j]) {
                        A[i][j] = A[i][k] + A[k][j];
                    }
                }
            }
        }
    }

    for(i = 1; i <= n; i++) {
        for(j = 1; j <= n; j++) {
            if (A[i][j] == INF)
                A[i][j] = 0;
            out << A[i][j] << " ";
        }
        out << "\n";
    }

    return 0;
}