#include <bits/stdc++.h>

using namespace std;

#define N 105

int A[2][N][N], n;

void rf() {
    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j)
                A[k%2][i][j] = min(A[(k+1)%2][i][j],
                                   A[(k+1)%2][i][k] + A[(k+1)%2][k][j]);
}

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

    fin >> n;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            fin >> A[0][i][j];

    rf();
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= n; ++j)
            fout << A[n%2][i][j] << ' ';
        fout.put('\n');
    }
}