#include <bits/stdc++.h>

using namespace std;

#define INFILE "royfloyd.in"
#define OUTFILE "royfloyd.out"

typedef long long ll;

const int N_MAX = 105;

int n;
ll d[N_MAX][N_MAX];

void solve(){

    cin >> n;

    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= n; ++j){
            cin >> d[i][j];
        }
    }

    for(int nodeAux = 1; nodeAux <= n; ++nodeAux){
        for(int node = 1; node <= n; ++node){
            for(int to = 1; to <= n; ++to){
                if(node != to){
                    d[node][to] = min(d[node][to], d[node][nodeAux] + d[nodeAux][to]);
                }
            }
        }
    }

    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= n; ++j){
            cout << d[i][j] << " ";
        }
        cout << '\n';
    }

}

int main(){
    ios_base::sync_with_stdio(false);
    freopen(INFILE, "r", stdin);
    freopen(OUTFILE, "w", stdout);
    cin.tie(0), cout.tie(0);
    solve();
    return 0;
}