#include <bits/stdc++.h>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
const short Nmax = 105;
int dist[Nmax][Nmax] , n;
int main()
{
    fin >> n;
    for(int i = 1 ; i <= n ; i++)
        for(int j = 1 ; j <= n ; j++)
            fin >> dist[i][j];
    for(int pas = 1 ; pas <= n ; pas++)
        for(int i = 1 ; i <= n ; i++)
            for(int j = 1 ; j <= n ; j++)
                if(dist[i][pas] && dist[pas][j] && (dist[i][j] > dist[i][pas] + dist[pas][j] || !dist[i][j]) && i != j)
                    dist[i][j] = dist[i][pas] + dist[pas][j];
    for(int i = 1 ; i <= n ; i++)
    {
        for(int j = 1 ; j <= n ; j++)
            fout << dist[i][j] << " ";
        fout << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}