#include <iostream>
#include <fstream>
using namespace std;
#define maxn 102
#define maxc 1000000
int n;
int m[maxn][maxn], dp[maxn][maxn];
void rf()
{
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
        {
            dp[i][j] = m[i][j];
            if(!dp[i][j]) dp[i][j] = maxc;
        }
    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] && i!=j && i!=k && j!=k)
    {
        dp[i][j] = dp[i][k] + dp[k][j];
    }
}
int main()
{
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");
    f>>n;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            f>>m[i][j];
    rf();
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
        {
            if (dp[i][j] == maxc) dp[i][j] = 0;
            g<<dp[i][j]<<" \n"[j==n];
        }
}