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

using namespace std;

#define pii pair <int, int>

string filename = "royfloyd";

#ifdef LOCAL
    ifstream fin("input.in");
    ofstream fout("output.out");
#else
    ifstream fin(filename + ".in");
    ofstream fout(filename + ".out");
#endif

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

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

int main(){

    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;
            }
        }
    }

    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 || i == j){
                fout << 0;
            }else{
                fout << rf[i][j];
            }
            fout << ' ';
        }
        fout << '\n';
    }

    return 0;
}