#include <iostream>
#include <fstream>
using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

const int MAXN = 102;
const int INF = 0x3f3f3f3f;
int N, dist[MAXN][MAXN];

void Read() {
    fin >> N;
    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= N; ++j) {
            fin >> dist[i][j];
            if (!dist[i][j] && i != j)
                dist[i][j] = INF;
        }
    }
}

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

void Write() {
    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= N; ++j)
            fout << dist[i][j] << ' ';
        fout << '\n';
    }
}

int main() {
    Read();
    Solve();
    Write();
    fin.close();
    fout.close();
    return 0;
}