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

ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

long long n, d[101][101];
const long long inf = 2000000000;

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

    for(int i = 1; i <= n; i ++) {
        for(int j = 1; j <= n; j ++) {
            if(d[i][j] == inf)
                d[i][j] = 0;
            g << d[i][j] << ' ';
        }
        g << '\n';
    }

    return 0;
}