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

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

const int INF = 1 << 31;

int main()
{
    int d[101][101], n;
    fin >> n;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            fin >> d[i][j];
            if (d[i][j] == 0 && i != j)
            {
                d[i][j] = INF;
            }
        }
    }

    for (int k = 1; k <= n; k++) 
    {
        for (int i = 1; i <= n; i++) 
        {
            for (int j = 1; j <= n; j++) 
            {
                if (d[i][k] != INF && d[k][j] != INF)
                {
                    d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
                }
            }
        }
    }

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++) 
        {
            if (d[i][j] == INF) 
            {
                fout << 0 << " ";
            }
            else
            {
                fout << d[i][j] << " ";
            }
        }
        fout << endl;
    }

    fin.close();
    fout.close();
    return 0;
}