#include <iostream>
#include <fstream>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cassert>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
#define NMax 101
using namespace std;

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

int a[NMax][NMax], n;

void royfloyd()
{
    for(int k = 0; k < n; ++k)
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < n; ++j)
                if(a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j])) a[i][j] = a[i][k] + a[k][j];
}

int main()
{
    f >> n;
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < n; ++j)
            f >> a[i][j];
    royfloyd();

    for(int i = 0; i < n; ++i)
    {
        for(int j = 0; j < n; ++j)
            g << a[i][j] << " ";
        g << '\n';
    }

    return 0;
}