#include <fstream>
#include <deque>
#include <vector>
#include <bitset>
#include <queue>
#include <algorithm>
#include <cmath>
#include <climits>

#define MOD 1000000007

using namespace std ;

ifstream cin ("royfloyd.in") ;
ofstream cout ("royfloyd.out") ;

int n, m[109][109], fw[109][109] ;

int main()
{
    cin >> n ;

    for(int f = 1 ; f <= n ; f ++)
        for(int e = 1 ; e <= n ; e ++)
            cin >> m[f][e] ;

    for(int k = 1 ; k <= n ; k ++)
        for(int f = 1 ; f <= n ; f ++)
            for(int e = 1 ; e <= n ; e ++)
                if(f != e && m[f][k] && m[k][e])m[f][e] = min({m[f][e] + !m[f][e] * (INT_MAX), m[f][k] + m[k][e]}) ;

    for(int f = 1 ; f <= n ; f ++)
    {
        for(int e = 1 ; e <= n ; e ++)
            cout << m[f][e] << " " ;

        cout << '\n' ;
    }

    return 0 ;
}