#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <climits>

using namespace std;

const int NMAX = 105;

int mat[NMAX][NMAX];
int N;

void floydWarshall() {
    for (int k = 1; k <= N; k++) {
        for (int i = 1; i <= N; i++) {
            for (int j = 1; j <= N; j++) {
                if ((mat[i][k] && mat[k][j]) || (mat[i][j] == 0 && i != j))
                    mat[i][j] = min(mat[i][j], mat[i][k] + mat[k][j]);
            }
        }
    }
}

int main() {
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);
    scanf("%d", &N);
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) {
            scanf("%d", &mat[i][j]);
        }
    }
    floydWarshall();
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) {
            printf("%d ", mat[i][j]);
        }
        printf("\n");
    }
}