#include <cstdio>
#include <cstring>
#include <cassert>

#include <fstream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <map>

using namespace std;

typedef long long LL;
typedef vector<int>::iterator it;

const int oo = 0x3f3f3f3f;
const int MAX_N = 105;

int N, Cost[MAX_N][MAX_N];

void RoyFloyd() {
    for (int k = 1; k <= N; ++k)
        for (int i = 1; i <= N; ++i)
            for (int j = 1; j <= N; ++j)
                Cost[i][j] = min(Cost[i][j], Cost[i][k] + Cost[k][j]);
}

void Solve() {
    RoyFloyd();
}

void Read() {
    assert(freopen("royfloyd.in", "r", stdin));
    assert(scanf("%d", &N) == 1);
    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= N; ++j) {
            assert(scanf("%d", &Cost[i][j]) == 1);
            if (Cost[i][j] == 0)
                Cost[i][j] = oo;
        }
    }
}

void Print() {
    assert(freopen("royfloyd.out", "w", stdout));
    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= N; ++j) {
            if (Cost[i][j] >= oo || i == j)
                Cost[i][j] = 0;
            printf("%d ", Cost[i][j]);
        }
        printf("\n");
    }
}

int main() {
    Read();
    Solve();
    Print();
    return 0;
}