#include <fstream>
#include <algorithm>

using namespace std;

int dist[100][100];

int main()
{
    int n, i, j, k;
    ifstream cin ( "royfloyd.in");
    ofstream cout ( "royfloyd.out" );

    cin >> n;
    for ( i = 0; i < n; i ++ )
      for ( j = 0; j < n; j ++ )
        cin >> dist[i][j];
    cin.close();

    for ( i = 0; i < n; i ++ )
      for ( j = 0; j < n; j ++ )
        for ( k = 0; k < n; k ++ )
          dist[j][k] = min( dist[j][k], dist[j][i] + dist[i][k]);

    for ( i = 0; i < n; i ++ ) {
      for ( j = 0; j < n; j ++ )
        cout << dist[i][j] << " ";
      cout << "\n";
    }

    cout.close();

    return 0;
}