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

using namespace std;

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

#define nmax 105
#define inf (1<<30)
#define ll long long

int n, a[nmax][nmax];

void citeste(){
    f >> n;
    for(int i=1; i<=n; ++i)
        for(int j=1; j<=n; ++j) f >> a[i][j];
}

void rezolva(){
    for(int k=1; k<=n; ++k){
        for(int i=1; i<=n; ++i){
            for(int j=1; j<=n; ++j){
                // distanta de la i la j incerc sa o minimizez prin k; adica i->k -> j;
                if (i == k || i == j || k == j) continue;
                if (a[i][k] && a[k][j]){
                    if (a[i][j] != 0){//daca am drum de la i la j
                        a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
                    }else a[i][j] = a[i][k] + a[k][j];
                }
            }
        }
    }
    for(int i=1; i<=n; ++i){
        for(int j=1; j<=n; ++j) g << a[i][j] << " ";
        g << "\n";
    }
}

int main(){
    citeste();
    rezolva();

    f.close();
    g.close();

    return 0;
}