#include <iostream>

using namespace std ;

int n ;

int b[1001][1001] ;

void floyds ( int b[][1001] )
{

    int i , j , k ;

    for ( k = 0 ; k < n ; k ++ )
    {

        for ( i = 0 ; i < n ; i ++ )
        {

            for ( j = 0 ; j < n ; j ++ )
            {

                if ( ( b[i][k] * b[k][j] != 0 ) && ( i != j ) )
                {

                    if ( ( b[i][k] + b[k][j] < b[i][j] ) || ( b[i][j] == 0 ) )
                    {

                        b[i][j] = b[i][k] + b[k][j] ;

                    }

                }

            }

        }

    }

    for ( i = 0 ; i < n ; i ++ )
    {

        cout << "nMinimum Cost With Respect to Node:" << i << endl ;

        for ( j = 0 ; j < n ; j ++ )
        {

            cout << b[i][j] << "t" ;

        }

    }

}

int main()
{

    cin >> n ;

    cout << "ENTER VALUES OF ADJACENCY MATRIXnn" ;

    for ( int i = 0 ; i < n ; i ++ )
    {

        cout << "enter values for "<< ( i + 1 ) << " row" << endl ;

        for ( int j = 0 ; j < n ; j ++ )
            cin >> b[i][j] ;

    }

    floyds (b) ;

    return 0 ;

}