#include <iostream>
#include <stdio.h>
#include <algorithm>

#define INF 0x3f3f3f3f

using namespace std;

int a[102][102];
int n;

int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);

    cin >> n;

    for(int i=1; i<=n; ++i)
        for(int j=1; j<=n; ++j)
    {
        cin>>a[i][j];
        if(a[i][j] == 0)
            a[i][j] = INF;
    }

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

    for(int i=1; i<=n; ++i)
    {
        for(int j=1; j<=n; ++j)
            if(a[i][j] == INF)
                cout<<0<<" ";
            else
            cout<<a[i][j]<<" ";

        cout<<endl;
    }
    return 0;
}