#include <fstream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <stack>
#include <iomanip>
#include <queue>

using namespace std;

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

#define nmax 110
int n,a[nmax][nmax],b[nmax][nmax],i,j,k;

int main()
{
    fin >> n;
    for (i=1; i<=n; i++)
        for (j=1; j<=n; j++)
            fin >> a[i][j],b[i][j]=a[i][j];
    for (k=1; k<=n; k++)
        for (i=1; i<=n; i++)
            for (j=1; j<=n; j++)
                if (i!=j&&b[i][k]&&b[k][j]&&(b[i][k]+b[k][j]<b[i][j]||!b[i][j]))
                b[i][j]=b[i][k]+b[k][j];
    for (i=1; i<=n; i++)
    {
        for (j=1; j<=n; j++)
            fout << b[i][j] << ' ';
        fout << '\n';
    }
}