#include <bits/stdc++.h>

using namespace std;

ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");

const int nmax = 1000, INF = 1000000000;
int d[nmax + 5][nmax + 5];

int main()
{
    int n, i, j, k;
    f >> n;
    for(i = 1; i <= n; ++i)
    {
        for(j = 1; j <= n; ++j)
        {
            f >> d[i][j];
            if(d[i][j] == 0 && i != j)
                d[i][j] = INF;
        }
    }
    for(k = 1; k <= n; ++k)
    {
        for(i = 1; i <= n; ++i)
        {
            for(j = 1; j <= n; ++j)
            {
                if(d[i][k] + d[k][j] < d[i][j])
                {
                   d[i][j] =  d[i][k] + d[k][j];
                }
            }
        }
    }
    for(i = 1; i <= n; ++i)
    {
        for(j = 1; j <= n; ++j)
        {
            if(d[i][j] == INF)
                g << "0 ";
            else
            {
                g << d[i][j] << " ";
            }
        }
        g << "\n";
    }
    return 0;
}