#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

const int HIGH = 10000000;
const int N_LIM = 100;

int N, A[N_LIM][N_LIM];

void royfloyd()
{

    for(int k = 0; k < N; k++)
        for(int i = 0; i < N; i++)
            for(int j = 0; j < N; j++)
                if(i == j)
                    continue;
                else
                    A[i][j] = min(A[i][j], A[i][k] + A[k][j]);
}

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

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

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

    royfloyd();

    for(int i = 0; i < N; i++)
        for(int j = 0; j < N; j++)
            fout << (A[i][j] >= HIGH ? 0 : A[i][j]) << (j == N - 1 ? '\n' : ' ');

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

    return 0;
}