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

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

const int INF = 1e9;

int main() {
    
    int n;
    fin >> n;
    int dist[105][105]; // MATRICEA de distanta

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

    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                if (dist[i][k] + dist[k][j] < dist[i][j]) {
                    dist[i][j] = dist[i][k] + dist[k][j];
                }
            }
        }
    }
    
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (dist[i][j] == INF) fout << 0 << " ";
            else fout << dist[i][j] << " ";
        }
        fout << "\n";
    }

    return 0;
}