#include <bits/stdc++.h>

using namespace std;

const int NMAX = 105;
const int INF = 1e6;

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


int n;
int adj[NMAX][NMAX];
int dp[NMAX][NMAX];

void solve()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
        {
            fin >> adj[i][j];
            if(adj[i][j])
                dp[i][j] = adj[i][j];
            else if(i != j)
                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(dp[i][j] > dp[i][k] + dp[k][j])
                    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)
                fout << dp[i][j] << ' ';
            else fout << 0 << ' ';
        }
        fout << '\n';
    }
}

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