#include <bits/stdc++.h>

using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int MAXN = 110, INF = 0x3f3f3f3f;

int dp[MAXN][MAXN], n;

void read() {
    fin >> n;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j) {
            fin >> dp[i][j];
            if (!dp[i][j] && i != j)
                dp[i][j] = INF;
        }
}

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

void print() {
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            if (dp[i][j] == INF)
                fout << 0 << " \n"[j == n];
            else
                fout << dp[i][j] << " \n"[j == n];
}

int main() {
    read();
    solve();
    print();
    return 0;
}