#include<iostream>
#include<fstream>
#include<limits>
#include <algorithm>
using namespace std;

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

int g[100][100];
int c[100][100];
int d[104][104];
int N, M;
const int INF = numeric_limits<int>::max() / 2;

void royfloyd() 
{
    for (int k = 0; k < N; k++) {
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                    d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
            }
        }
    }
}

int main()
{
    fin >> N;
    
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            int x;
            fin >> x;
            d[i][j] = x;
            if (d[i][j] == 0)
                d[i][j] = INF;
        }
        d[i][i] = 0;
    }

    royfloyd();

    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) { 
            if (d[i][j] != INF)
                fout << d[i][j] << " ";
            else
                fout << 0 << " ";
        }
        fout << endl;
    }
    fin.close();
    fout.close();
}