#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100;

int D[MAX_N + 1][MAX_N + 1];
int N;

int main()
{
    ifstream in("data.in");
    ofstream out("data.out");

    in >> N;

    for (int i = 1; i <= N; ++i)
        for (int j = 1; j <= N; ++j)
        {
            in >> D[i][j];
        }

    for (int k = 1; k <= N; ++k)
        for (int i = 1; i <= N; ++i)
            if (i != k)
                for (int j = 1; j <= N; ++j)
                    if (i != j && j != k)
                        if (D[i][j] > D[i][k] + D[k][j])
                            D[i][j] = D[i][k] + D[k][j];

    for (int i = 1; i <= N; ++i)
    {
        for (int j = 1; j <= N; ++j)
        {
            out << D[i][j] << " ";
        }

        out << "\n";
    }

    return 0;
}