#include <fstream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>

#define ll long long
#define pb push_back
#define bg begin()
#define ed end()
#define cl clear()
#define pi pair<int, int>

///#define int ll

using namespace std;

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

const int MOD = 1e9;
const char nl = '\n';
const int NMAX = 105;
const int INF = 1e9;

int adj[NMAX][NMAX], dist[NMAX][NMAX], n;

void rf(){
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            if(i == j)
                dist[i][j] = 0;
            else if(adj[i][j])
                dist[i][j] = adj[i][j];
            else
                dist[i][j] = INF;
        }
    }
    for(int k = 1; k <= n; ++k) {
        for(int i = 1; i <= n; ++i) {
            for(int j = 1; j <= n; ++j) {
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }
}

void solve(){
    rf();
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= n; ++j)
            out << dist[i][j] << ' ';
        out << nl;
    }
}

int main(){
    in >> n;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            in >> adj[i][j];
    solve();
    return 0;
}