#include <iostream>
#include <vector>
#include <fstream>

using namespace std;

int main()
{
    ifstream fin("royfloyd.in");
    ofstream fout("royfloyd.out");
    int n;
    
    fin >> n;
    
    vector<vector<int>> distances(n + 1, vector<int>(n + 1));
    
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            fin >> distances[i][j];
        }
    }
    
    for(int k = 1; k <= n; k++) {
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) {
                if(i == j) continue;
                
                if(distances[i][k] && distances[k][j])
                {
                    distances[i][j] = min(distances[i][j], distances[i][k] + distances[k][j]);
                    
                    if(distances[i][j] == 0)
                        distances[i][j] = distances[i][k] + distances[k][j];
                }
            }
        }
    }
    
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            fout << distances[i][j] << ' ';
        }
        fout << endl;
    }
    
    return 0;
}