#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <pi, pi>
#define vi vector <int>
const ll mod = 1e9 + 7;
int a[101][101], n;

void royfloyd(){
    for(int k=1; k<=n; k++){
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                if(a[i][k] && a[k][j] && (a[i][k]+a[k][j]<a[i][j] || !a[i][j]) && i!=j) a[i][j]=a[i][k]+a[k][j];
            }
        }
    }
}

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    ifstream cin("royfloyd.in");
    ofstream cout("royfloyd.out");
    cin>>n;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++) cin>>a[i][j];
    }
    royfloyd();
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++) cout<<a[i][j]<<" ";
        cout<<'\n';
    }
}