#include <bits/stdc++.h>

using namespace std;

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

const int Nmax = 105;

int a[Nmax][Nmax], n;

void Read()
{
    int i, j;
    fin >> n;
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
            fin >> a[i][j];
    fin.close();
}
void RF()
{
    int i, j, k;
    for (k = 1; k <= n; k++)
        for (i = 1; i <= n; i++)
            for (j = 1; j <= n; j++)
                if ((a[i][k] && a[k][j] &&(a[i][j] > a[i][k] + a[k][j] || !a[i][j])) && i != j)
                    a[i][j] = a[i][k] + a[k][j];

    /// (a[i][k] && a[k][j] - exista drum i-k, k-j)
    ///(i != j - ciclu)
    ///(!a[i][j] - nu exista arc i -> j insa poate exista drum i -> k -> j prin nodurile intermediare (1,2,...,k)
}

void Write()
{
    int i, j;
    for (i = 1; i <= n; i++)
    {
        for (j = 1; j <= n; j++)
            fout << a[i][j] << " ";
        fout << "\n";
    }
    fout.close();
}

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