#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define inf 1e3+1
using namespace std;

const int NMAX = 101;
int dp[NMAX][NMAX];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
void solve() {
    for (int k = 0; k < n; ++k) {
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                dp[i][j] = min(dp[i][k]+dp[k][j],dp[i][j]);
            }
        }
    }
}
void read() {
    fin >> n;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            fin >> dp[i][j];
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (dp[i][j] == 0) {
                dp[i][j] = inf;
            }
        }
    }
}
void afis() {
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (dp[i][j] == inf||i==j) {
                fout << "0 ";
            }
            else {
                fout << dp[i][j] << " ";
            }
        }
        fout << "\n";
    }
}
int main()
{
    read();
    solve();
    afis();
    return 0;
}
//=^..^=