#include<cstdio>
#include<fstream>
#include<algorithm>
#define NMAx 101

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

inline int minim(int b, int c)
{
    if(b > c) return c;
    return b;
}

void FloydWarshall()
{
    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
             if(a[i][k] != 0 && a[k][j] != 0)
                if(a[i][k] + a[k][j] < a[i][j] || a[i][j] == 0) a[i][j] = a[i][k] + a[k][j];

}

int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);

    fin >> n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            fin >> a[i][j];

    FloydWarshall();
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            if(i-j) fout << a[i][j] << " ";
            else fout << '0' << " ";
        }
        fout << "\n";
    }
    return 0;
}