#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

#define vt vector
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

#define fr first 
#define sc second

using namespace std;

string filename = "royfloyd";
ifstream fin(filename + ".in");
ofstream fout(filename + ".out");

////////////////////////////////////////////////////////////

const int NMAX = 100;
const int INF = 1e9;

int cost[NMAX + 1][NMAX + 1];
int rf[NMAX + 1][NMAX + 1];

void solve(){
    int n;
    fin >> n;

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            fin >> rf[i][j];

            if(rf[i][j] == 0){
                rf[i][j] = INF;
            }
        }
        rf[i][i] = 0;
    }

    for(int k = 1; k <= n; k++){
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                rf[i][j] = min(rf[i][j], rf[i][k] + rf[k][j]);
            }
        }
    }

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(rf[i][j] != INF){
                fout << rf[i][j] << ' ';
            }else{
                fout << 0 << ' ';
            }
        }
        fout << '\n';
    }

}

int main(){

    int T;
    //fin >> T;

    T = 1;

    while(T--){
        solve();
    }

    return 0;
}