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

const int max_up = 1e5 + 5;

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

int g[101][101];

int main()
{
    int n; fin >> n;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            fin >> g[i][j];
    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j)
                g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
    for(int i = 1; i <= n; ++i, fout << "\n")
        for(int j = 1; j <= n; ++j)
            fout << g[i][j] << " ";
    return 0;
}