#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <utility>
#define ll long long

using namespace std;

const int INF = 1e9 + 5;

int main() {

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

    int n;
    in >> n;
    vector<vector<int>> dp(n + 1, vector<int> (n + 1, 0));
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= n; j ++) {
            in >> dp[i][j];
            if(dp[i][j] == 0)
                dp[i][j] = INF;
        }

    for(int k = 1; k <= n; k ++)
        for(int i = 1; i <= n; i ++)
            for(int j = 1; j <= n; j ++)
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
    for(int i = 1; i <= n; i ++) {
        for(int j = 1; j <= n; j ++) {
            if(dp[i][j] == INF || i == j)
                out << 0 << " ";
            else
                out << dp[i][j] << " ";
        }
        out << "\n";
    }

    return 0;
}