#include <cstdio>
#include <cstring>
#include <algorithm> 
using namespace std;

#define inf 0x3f3f3f3f

int n;
int d[101][101];

void read()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
	for (int j = 1; j <= n; ++j)
	{
	    int dist; scanf("%d", &dist);
	    if (dist) d[i][j] = dist;
	    else d[i][j] = inf;
	}
} 

void rf()
{
    for (int k = 1; k <= n; ++k)
	for (int i = 1; i <= n; ++i)
	    for (int j = 1; j <= n; ++j)
		d[i][j] = min(d[i][j], d[i][k] + d[k][j]); 
}

void print()
{
    for (int i = 1; i <= n; ++i)
    {
	for (int j = 1; j <= n; ++j)
	    printf("%d ", d[i][j]);
	printf("\n");
    }
}

int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);

    read();
    rf();
    print();

    return 0;
}