#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <climits>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int main()
{
    int n;
    fin>>n;
    int d[n+1][n+1], p[n+1][n+1];
    for(int i= 1; i<=n; ++i)
    {
        for(int j=1; j<=n; ++j)
        {
            fin>>d[i][j];
            if(d[i][j])p[i][j] = i;
        }
    }
    for(int k=1; k<=n; ++k)
    {
        for(int i=1; i<=n; ++i)
        {
            for(int j=1; j<=n; ++j)
            {
                if(d[i][j]>d[i][k] + d[k][j])
                {
                    d[i][j] = d[i][k] + d[k][j];
                    p[i][j] = p[k][j];
                }
            }
        }
    }
    for(int i =1; i<=n; ++i)
    {
        for(int j =1; j<=n; ++j)fout<<d[i][j]<<' ';
        fout<<'\n';
    }
    return 0;
}