#include <fstream>
#include <algorithm>

using namespace std;

#define FIN "royfloyd.in"
#define FOUT "royfloyd.out"
#define MAX_N 128
#define oo 0x3f3f3f3f

int N;
int Mat[MAX_N][MAX_N];

void read() {
    scanf("%d", &N);
    for (int i = 1; i <= N; ++i)
        for (int j = 1; j <= N; ++j) {
            scanf("%d", &Mat[i][j]);
            if (i != j && !Mat[i][j])
                Mat[i][j] = oo;
        }
}

void solve() {
    for (int k = 1; k <= N; ++k)
        for (int i = 1; i <= N; ++i)
            for (int j = 1; j <= N; ++j)
                Mat[i][j] = min(Mat[i][j], Mat[i][k] + Mat[k][j]);
    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= N; ++j)
            printf("%d ", Mat[i][j]);
        printf("\n");
    }
}

int main() {
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
    read();
    solve();
    return 0;
}