#include <fstream>
#include <algorithm>

using namespace std;

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

const int NMax = 100, oo = 1e9;

int A[NMax + 5][NMax + 5], N;

void RoyFloyd()
{
    for(int k = 1; k <= N; k++)
        for(int i = 1; i <= N; i++)
            for(int j = 1; j <= N; j++)
            {
                if(i != j) A[i][j] = min(A[i][k] + A[k][j], A[i][j]);
            }
}

void Read()
{
    fin >> N;

    for(int i = 1; i <= N; i++)
        for(int j = 1; j <= N; j++)
        {
            fin >> A[i][j];

            if(A[i][j] == 0) A[i][j] = oo;
        }
}

void Print()
{
    for(int i = 1; i <= N; i++) {
        for(int j = 1; j <= N; j++){
            fout << ((A[i][j] == oo) ? 0 : A[i][j]) << " ";
        }
        fout << '\n';
    }
    fout << '\n';
}

int main()
{
    Read();
    RoyFloyd();
    Print();

    fin.close();
    fout.close();

    return 0;
}