#include <iostream>
#include <fstream>
using namespace std;
#define oo  0x3f3f3f3f


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

int main()
{
    int n; // 0;100
    
    in>>n;
    
    int m[101][101], dp[101][101], next[101][101] = {};
    
     // practic, k = 0 case
    for(int i = 0; i < n; ++i)
    {
        for(int j = 0; j < n; ++j)
        {
            in>>m[i][j];
            
            dp[i][j] = m[i][j];
            if(m[i][j] != oo) //daca am drum pana la j
            {
                next[i][j] = j; //by default, vreau sa ma duc in nodul j urmatoarea data
            }
        }
    }
    
    for(int k = 0; k < n; ++k)
    {
        for(int i = 0; i < n; ++i)
        {
            for(int j = 0; j < n; ++j)
            {
                if(dp[i][k] + dp[k][j] < dp[i][j]) //vad care e drumul mai scurt dintre i->k->j , respectiv cel de pana acum
                {
                    dp[i][j] = dp[i][k] + dp[k][j];
                    next[i][j] = next[i][k];
                }
            }
        }
    }
    
    for(int i = 0; i < n; ++i)
    {
        for(int j = 0; j < n; ++j)
        {
            out<<dp[i][j]<<' ';
        }
        out<<endl;
    }
    
    return 0;
}