#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <list>
#include <map>
#include <math.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int MMAX = 1999999997;
int v[101][101];
int main(){
    int n;
    f>>n;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {f>>v[i][j];
            if(v[i][j] == 0)v[i][j] = MMAX/2;
        }
        v[i][i] = 0;
    }
    for(int k=1;k<=n;k++)
    {
        for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            if(v[i][j] > v[i][k] + v[k][j] && i!=j && v[i][k] && v[k][j])
                v[i][j] = v[i][k] + v[k][j];
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        g<<v[i][j]<<" ";
        g<<"\n";
    }
    return 0;
}