#include <bits/stdc++.h>
#define N 105

using namespace std;

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

int n, dist[N][N];

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
        {
            fin >> dist[i][j];
            if (!dist[i][j])
                dist[i][j] = INT_MAX;
        }

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

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (dist[i][j] == INT_MAX)
                dist[i][j] = 0;
            fout << dist[i][j] << " ";
        }
        fout << "\n";
    }
    return 0;
}