#include <cstdio>
using namespace std;
#define MAX 101
#define INF 1000000
int dp[MAX][MAX], n;
int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);

    scanf("%d", &n);
    
    int i, j, k;

    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++){
            scanf("%d", &dp[i][j]);
            if(dp[i][j] == 0) 
		dp[i][j] = INF;
        }

    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            if(dp[i][j] > dp[i][k] + dp[k][j])
                dp[i][j] = dp[i][k] + dp[k][j];

    for(i=1; i<=n; i++){
        for(j=1; j<=n; j++) 
            if(i == j or dp[i][j] == INF)
		printf("0 ");
            else 
		printf("%d ", dp[i][j]);
        printf("\n");
    }

    return 0;
}