#include <iostream>
#include <algorithm>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
#define INF 1e9

int main() {
    ios_base::sync_with_stdio(false);
    f.tie(nullptr);
    g.tie(nullptr);

    int n;
    f >> n;
    int c[n+1][n+1], d[n+1][n+1];
    for( int i = 1; i <= n; i++ )
    {
        for( int j = 1; j <= n; j++ )
        {
            f >> c[i][j];
            d[i][j] = c[i][j];
            if( d[i][j] == 0 )
                d[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 != j)
                    d[i][j] = min( d[i][j], d[i][k] + d[k][j] );
            }
        }
    }
    for( int i = 1; i <= n; i++ )
        {
            for( int j = 1; j <= n; j++ )
            {
                if( d[i][j] != INF )
                    g << d[i][j] << " ";
                else
                    g << "0 ";
            }
            g << "\n";
        }

    return 0;
}