#include<stdio.h>
#include<algorithm>

FILE *in, *out;

using namespace std;

int v[101][101], n;

int main ()
{

    in = fopen("royfloyd.in", "r");
    out = fopen("royfloyd.out", "w");

    fscanf(in, "%d", &n);

    for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                    fscanf(in, "%d", &v[i][j]);
                    if (v[i][j] == 0 || i == j) {
                            v[i][j] = 0x3f3f3f3f;
                    }
            }
    }

    for(int k = 0; k < n; k++) {
            for(int i = 0; i < n; i++) {
                    for(int j = 0; j < n; j++) {
                            v[i][j] = min(v[i][j], (v[i][k] + v[k][j]));
                    }
            }
    }

    for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                    if (v[i][j] > 0x3f3f3f3f || i == j) {
                            v[i][j] = 0;
                    }
                    fprintf(out, "%d ", v[i][j]);
            }
            fprintf(out, "\n");
    }

    fclose(in);
    fclose(out);

    return 0;
}