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

const int INF = 1e9;

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

    int N;
    fin >> N;

    vector<vector<int>> dist(N, vector<int>(N));

    // read matrix
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            fin >> dist[i][j];
            if (i != j && dist[i][j] == 0)
                dist[i][j] = INF; // 0 means no edge
        }
    }

    // Floyd–Warshall
    for (int k = 0; k < N; k++)
        for (int i = 0; i < N; i++)
            for (int j = 0; j < N; j++)
                if (dist[i][k] + dist[k][j] < dist[i][j])
                    dist[i][j] = dist[i][k] + dist[k][j];

    // output result (INF -> 0)
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (dist[i][j] == INF) fout << 0;
            else fout << dist[i][j];
            if (j + 1 < N) fout << " ";
        }
        fout << "\n";
    }

    return 0;
}