#include <bits/stdc++.h>

using namespace std;

const int NMAX = 105;
const int INF = (1 << 30);
int N, dp[NMAX][NMAX];

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 >> dp[i][j];
            if (dp[i][j] == 0)
                dp[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 (i != k && j != k && i != j && dp[i][k] != INF && dp[k][j] != INF)
                    dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
    for (int i = 1;i <= N;++i)
        for (int j = 1;j <= N;++j)
            if (dp[i][j] == INF)
                dp[i][j] = 0;
    for (int i = 1;i <= N;++i)
        for (int j = 1;j <= N;++j)
            fout << dp[i][j] << " \n"[j == N];
    fin.close();
    fout.close();
    return 0;
}