#include <iostream>
#include <fstream>
#define NMAX (100 + 3)
using namespace std;

int main() {

    ifstream f("date.in");
    ofstream g("date.out");

    int n, i, j, k, distance[NMAX][NMAX];

    f >> n;

    for (i = 0; i < n; ++i) {
        for (j = 0; j < n; ++j) {
            f >> distance[i][j];
        }
    }

    for (k = 0; k < n; ++k) {
        for (i = 0; i < n; ++i) {
            for (j = 0; j < n; ++j) {
                if (distance[i][k] != 0 && distance[k][j] != 0 && distance[i][k] + distance[k][j] < distance[i][j]) {
                    distance[i][j] = distance[i][k] + distance[k][j];
                }
            }
        }
    }

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

    return 0;
}