#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int long long
#define double long double
#define pb push_back
#define endl '\n'
#define er erase
#define sz size
#define in insert
#define mp make_pair
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mod 1000000007
#define INF LONG_LONG_MAX

int n;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

void solve()
{
    fin>>n;
    int w[n+1][n+1], sp[n+1][n+1][n+1];
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            fin>>w[i][j];
            sp[i][j][0]=w[i][j];
        }
    }
    for(int k=1;k<=n;k++)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(i==j){continue;}
                if(sp[i][j][k-1]==0){sp[i][j][k]=sp[i][k][k-1]+sp[k][j][k-1];}
                else{sp[i][j][k]=min(sp[i][j][k-1], sp[i][k][k-1]+sp[k][j][k-1]);}
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            fout<<sp[i][j][n]<<' ';
        }
        fout<<endl;
    }
}

int32_t main()
{
    //ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int tc=1;
    //cin>>tc;
    while(tc--)
    {
        solve();
    }
    return 0;
}