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

using namespace std;

///#include <tryhardMODE>
///#include <GODMODE::ON>

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

const int NMAX=105;
int dist[NMAX][NMAX];
int n;

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

void royfloyd()
{
    int k,i,j;
    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                if(dist[i][k]!=0 && i!=j && dist[k][j]!=0 && (dist[i][j]==0 || dist[i][j]>dist[i][k]+dist[k][j]))
                    dist[i][j]=dist[i][k]+dist[k][j];
}

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

int main()
{
    init();
    royfloyd();
    share_solution();
    return 0;
}