#include <cstdio>
#include <algorithm>

using namespace std;

const int N = 100 + 7;
const int INF = (int) 1e9;
int n;
int d[N][N];

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", &d[i][j]);
                        if (i != j && d[i][j] == 0) {
                                d[i][j] = INF;
                        }
                }
        }
        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]);
                        }
                }
        }
        for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= n; j++) {
                        if (d[i][j] == INF) {
                                d[i][j] = 0;
                        }
                        printf("%d ", d[i][j]);
                }
                printf("\n");
        }
}