#include <fstream>

using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");

const int MAXN = 100;
int dist[MAXN][MAXN];

int main()
{
    int N;
    in >> N;
    for (int i = 0; i < N; ++i)
        for (int j = 0; j < N; ++j)
                in >> dist[i][j];

    for (int i = 0; i < N; ++i)
        for (int j = 0; j < N; ++j)
            for (int k = 0; k < N; ++k)
                if (i != j && dist[i][k] && dist[k][j] && (!dist[i][j] || dist[i][j] > dist[i][k] + dist[k][j]))
                    dist[i][j] = dist[i][k] + dist[k][j];

    for (int i = 0; i < N; ++i)
    {
        for (int j = 0; j < N; ++j)
            out << dist[i][j] << ' ';
        out << '\n';
    }

    return 0;
}