#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

///#include <tryhardmode>
///#include <GOMDODE::ON>

using namespace std;

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

const int NMAX=1e2+5;

int dist[NMAX][NMAX];

int main()
{
    int n,i,j,k;
    fin>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fin>>dist[i][j];
    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                if(i!=j &&  dist[i][k] && dist[k][j] && (dist[i][j]==0 || dist[i][j]>dist[i][k]+dist[k][j]))
                    dist[i][j]=dist[i][k]+dist[k][j];
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
            fout<<dist[i][j]<<" ";
        fout<<"\n";
    }
    return 0;
}