#include <bits/stdc++.h>
using namespace std;

const int NMAX = 101;
const int INF = 1000000000;
int n, a[NMAX][NMAX];

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

void royFloyd() {
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++) {
                if (i == j) continue;
                if (a[i][k] + a[k][j] < a[i][j])
                    a[i][j] = a[i][k] + a[k][j];
            }
}


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

    read();
    royFloyd();

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++)
            printf("%d ", a[i][j] == INF ? 0 : a[i][j]);
        printf("\n");
    }

    return 0;
}