#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

#define MAX 100
int a[MAX][MAX] ,n;

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

    //citire
    scanf("%d",&n);
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
        {
            scanf("%d", &a[i][j]);
            if(!a[i][j] && i!=j) a[i][j] = INT_MAX/2;
        }

    //algoritmul roy-floyd:
    //daca mutam forurile in loc de k, i, j in i, j, k cu conditia interioara aceeasi
    //atunci in loc sa calculeze drumul i->k->j, va calcula j->k->i, adica sensul va fi invers
    for(int k = 0; k < n; k++)
        for(int i = 0; i < n; i++)
            for(int j = 0; j < n; j++)
                if(a[i][j] > a[i][k]+a[k][j])
                    a[i][j] = a[i][k]+a[k][j];

    //afisare
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
            printf("%d ", a[i][j]);

        printf("\n");
    }



    return 0;
}