#include <fstream>
#include <algorithm>

using namespace std;

int main()
{
    ifstream in("royfloyd.in");
    ofstream out("royfloyd.out");
    
    int n;
    in >> n;
    
    int nodes[n][n];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            in >> nodes[i][j];
        }
    }
    
    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (nodes[i][k] && nodes[k][j]) {
                    if ((nodes[i][j] > nodes[i][k] + nodes[k][j]
                        || !nodes[i][j]) && i != j)
                        nodes[i][j] = nodes[i][k] + nodes[k][j];
                }
            }
        }
    }
    
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            out << nodes[i][j] << " ";
        }
        out << "\n";
    }
    
    in.close();
    out.close();
    return 0;
}