#include <fstream>

using namespace std;

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

const int N = 101;

int a[N][N];

int n;

void royfloyd(){
    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                //daca se poate ajunge de la i la k si de la k la j
                if( ! ( a[ i ][ k ] && a[ k ][ j ]) ) continue;
                //daca e mai eficient prin k
                if ( ! (a[i][k] + a[k][j] < a[i][j] || a[i][j] == 0 ) ) continue;
                //daca i e diferit de j
                if( i == j ) continue;
                a[ i ][ j ] = a[ i ][ k ] + a[ k ][ j ];
            }
        }
    }
}

int main()
{
    in>>n;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            in>>a[i][j];
        }
    }
    royfloyd();
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            out<<a[i][j]<<" ";
        }
        out<<"\n";
    }
    return 0;
}