#include <cstring>
#include <fstream>
#include <algorithm>

using namespace std;

const int INF = 0x3f3f3f3f;

int N;
int A[103][103];

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

    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] = INF;
        }
    for (int k = 1; k <= N; ++k)
        for (int i = 1; i <= N; ++i)
            for (int j = 1; j <= N; ++j)
                if (i != k && j != k && i != j && A[i][k] + A[k][j] < A[i][j])
                    A[i][j] = A[i][k] + A[k][j];

    for (int i = 1; i <= N; ++i)
    {
        for (int j = 1; j <= N; ++j)
        {
            if (A[i][j] == INF)
                A[i][j] = 0;
            fout << A[i][j] << ' ';
        }
        fout << '\n';
    }

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