#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

void Roy_Floyd(vector<vector<int>> &graph, int n)
{
    for (int k = 0; k < n; ++k)
    {
        for (int i = 0; i < n; ++i)
        {
            for (int j = 0; j < n; ++j)
            {
                if (graph[i][k] && graph[k][j] && (i != j))
                {
                    if (graph[i][j] == 0 || graph[i][k] + graph[k][j] < graph[i][j])
                    {
                        graph[i][j] = graph[i][k] + graph[k][j];
                    }
                }
            }
        }
    }
}

int main()
{
    int n;
    fin >> n;

    vector<vector<int>> graph(n, vector<int>(n));

    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            fin >> graph[i][j];
        }
    }

    Roy_Floyd(graph, n);

    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            fout << graph[i][j] << " ";
        }
        fout << "\n";
    }

    return 0;
}