#include <bits/stdc++.h>

using namespace std;

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

int N, Map[105][105], Drum[105][105];

void citire()
{
    fin>>N;
    for(int i=1;i<=N;i++)
        for(int j=1;j<=N;j++)
        {
            fin>>Map[i][j];
            Drum[i][j]=Map[i][j];
        }
}

bool existaDrum(int a, int b, int c)
{
    return Map[a][b] && Map[b][c];
}

void royFloyd()
{
	for(int k = 1; k <= N; k++)
		for(int i = 1; i <= N; i++)
			for(int j = 1; j <= N; j++)
				if (existaDrum(i,k,j) && (Drum[i][j] > Map[i][k] + Map[k][j] || !Map[i][j]) && i!=j) ///i!=j -> nodurile sunt diferite, Map[i][k]-Map[k][j] -> pot ajunge din nodul i in nodul j, Verific daca nu exista deja drum sau daca acesta e mai mare decat cel curent;
                    Drum[i][j] = Map[i][k] + Map[k][j];
}

void afisare()
{
    for(int i=1;i<=N;i++)
    {
        for(int j=1;j<=N;j++)
            fout<<Drum[i][j]<<" ";
        fout<<'\n';
    }
}
int main()
{
    citire();
    royFloyd();
    afisare();
    return 0;
}