#include <bits/stdc++.h>
using namespace std;

ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

#define INF 1e9

int N,M;
int Graph[101][101];
int main()
{
    f>>N;
     for(int i = 1; i <= N; i++)
        for(int j = 1; j <= N; j++)
            {
                f >> Graph[i][j];
                if(Graph[i][j]==0)
                    Graph[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(Graph[i][j]> Graph[i][k]+Graph[k][j])
                    Graph[i][j] = Graph[i][k]+Graph[k][j];

    for(int i = 1; i <= N; i++)
    {
        for(int j = 1; j <= N; j++)
            if(i==j || Graph[i][j]==INF)
                g<<"0 ";
        else
            g << Graph[i][j] << " ";
        g << endl;
    }
    return 0;
}