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

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

#define INF 1000000000 
#define NMAX 105

int n;
int a[NMAX][NMAX];

int main() {
    fin >> n;
    
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            fin >> a[i][j];
            
            if (a[i][j] == 0 && i != j) {
                a[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 (a[i][k] != INF && a[k][j] != INF) {
                    if (a[i][j] > a[i][k] + a[k][j]) {
                        a[i][j] = a[i][k] + a[k][j];
                    }
                }
            }
        }
    }

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

    return 0;
}