#include <iostream>
#include <fstream>
#include <unordered_map>
#include <queue>
#include <stack>
#include <vector>

#define ll long long
#define ull unsigned long long
#define pb push_back
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");

const int NMax = 1e2 + 5;
const int inf = 1e9 + 5;

int N;
int dp[NMax][NMax];

int main() {
    in>>N;
    for (int i=1;i <= N;++i) {
        for (int j=1;j <= N;++j) {
            int val;
            in>>val;
            dp[i][j] = (i != j && !val) ? inf : val;
        }
    }

    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) {
            out<<( (dp[i][j] == inf) ? 0 : dp[i][j])<<' ';
        }
        out<<'\n';
    }

    in.close();out.close();
    return 0;
}