#include <iostream>

using namespace std;

const int NMAX = 257;

const int INF = 1e9;

int main()
{
    int dist[NMAX][NMAX];
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            cin >> dist[i][j];
            if(i != j && dist[i][j] == 0)
            dist[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(dist[i][j] > dist[i][k] + dist[k][j])
                    dist[i][j] = dist[i][k] + dist[k][j];
    
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(dist[i][j] == INF)
                cout << 0 << " ";
            else
                cout << dist[i][j] << " ";
            cout << '\n';
        }
    }
    return 0;
}