#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <climits>
#include <algorithm>
using namespace std;

ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

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

    vector<vector<int>> matrice_costuri(n + 1);

    for (int i = 1; i <= n; i++)
    {
        matrice_costuri[i].resize(n + 1, 0);
        for (int j = 1; j <= n; j++)
        {
            f >> matrice_costuri[i][j];
            // if (matrice_costuri[i][j] == 0)
            //     matrice_costuri[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++)
                matrice_costuri[i][j] = min(matrice_costuri[i][k] + matrice_costuri[k][j], matrice_costuri[i][j]);

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            g << matrice_costuri[i][j] << ' ';
        }
        g << '\n';
    }
    return 0;
}