#include <iostream>
#include <bits/stdc++.h>
#define MAX 101
#define INF 2000
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int N,M;
int Graph[MAX][MAX];
int main()
{
    in>>N;
     for(int i = 1; i <= N; i++)
        for(int j = 1; j <= N; j++)
            {in >> 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)
            out<<"0 ";
        else
            out << Graph[i][j] << " ";
        out << endl;
    }
    return 0;
}