#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

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

const int Dim = 102, Inf = 0x3f3f3f3f;

int n, c[Dim][Dim];

void Read();
void Floyd_Warshall();
void Write();

int main()
{
    Read();
    Floyd_Warshall();
    Write();
    return 0;
}

void Read()
{
    fin >> n;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            fin >> c[i][j];

}

void Floyd_Warshall()
{
    for (int k = 1; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
            for  (int j = 1; j <= n; ++j)
            {
                if ( (c[i][k] * c[k][j]) && i != j )
                {
                    if ( c[i][j] == 0 )
                        c[i][j] = c[i][k] + c[k][j];
                    else
                        c[i][j] = min( c[i][j], c[i][k] + c[k][j] );
                }
            }
}
void Write()
{
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
            fout << c[i][j] << ' ';
        fout << '\n';
    }

}