#include <bits/stdc++.h>
#define nmax 107

using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n;
int a[nmax][nmax];

void Citire()
{
    int i, j;
    fin >> n;
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
            fin >> a[i][j];
}

void RoyFloyd()
{
    int i, j, k;
    for (k  = 1; k <= n; k++) /// luam k drept legatura intre nodurile i si j
        for (i = 1; i <= n; i++)
            for (j = 1; j <= n; j++)
                if (i != j && i != k && j != k) /// verificam sa fie diferite
                    if (a[i][k] && a[k][j] &&/// daca exista drumurile (i, k), (k, j)
                       (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))/// si distanta e mai mare
                        a[i][j] = a[i][k] + a[k][j]; /// actualizam
}

void Afisare()
{
    int i, j;
    for (i = 1; i <= n; i++)
    {
        for (j = 1; j <= n; j++)
            fout << a[i][j] << " ";
        fout << "\n";
    }
}

int main()
{
    Citire();
    RoyFloyd();
    Afisare();
    fin.close();
    fout.close();
    return 0;
}