#include <fstream>
#include <vector>
#include <queue>

using namespace std;

const int INF = 1e9;

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

int a[105][105];

int main()
{
    int n;
    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 = 0; i <= n; i++)
            for(int j = 0; j <= n; j++)
                if(i != j)
                    a[i][j] = min(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)
                fout << 0 << ' ';
            else
                fout << a[i][j] << ' ';
        }
        fout << '\n';
    }
}