#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

const int NMax = 102;
const int inf = (1<<30) + 1;
int n;
int m[NMax][NMax];
void royfloyd()
{
    for(int k = 1; k <= n; k++)
    {
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= n; j++)
            {
                m[i][j] = min(m[i][j], m[i][k] + m[k][j]);
            }
        }
    }
}


int main()
{
    int i,j;
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");
    f>>n;
    for(i = 1 ; i <= n; i++)
    {
        for(j = 1; j <= n ; j++)
        {
         f>>m[i][j];
         if((i != j ) && m[i][j] == 0)
         {
             m[i][j] = inf;
         }
        }
    }
    royfloyd();
    for(i = 1; i <= n; i++)
    {
        for(j =1; j <= n; j++)
        {
            if(m[i][j] != inf)
                g<<m[i][j]<<" ";
            else
                g<<"0 ";
        }
        g<<"\n";
    }
}