#include <bits/algorithmfwd.h>
#include <fstream>
#define oo 2e9
using namespace std;

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


int n, m, x, y, D[105][105], a[105][105];

void Roy()
{
    for(int i = 1; i <= n; i++)
    for(int j = 1; j <= n; j++) {
        if (a[i][j] == 0 && i != j)
            D[i][j] = oo;
        else
            D[i][j] = a[i][j];
    }
    for(int k = 1; k <= n; k++)
     for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            if(D[i][j] > D[i][k] + D[k][j])
                D[i][j] = D[i][k] + D[k][j];
}


int main()
{
    fin >> n;
    for(int i = 1; i <= n;i ++)
        for(int j = 1; j <= n; j++)
            fin >> a[i][j];
    Roy();
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
            fout << D[i][j] << " ";
        fout << '\n';
    }
    return 0;
}