#include <iostream>
#include <fstream>
#define NMAX 100
using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

void floydWarshall(int M[NMAX][NMAX], int n) {
    for (int k = 0; k < n; k++)
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                if (M[i][j] > M[i][k] + M[k][j])
                    M[i][j] = M[i][k] + M[k][j];
}

int main()
{
    int n, M[NMAX][NMAX], MINIM[NMAX][NMAX];
    fin>>n;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            fin>>M[i][j];

    floydWarshall(M, n);

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++)
            fout<<M[i][j]<<' ';
        fout<<"\n";
    }
    return 0;
}