#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "royfloyd";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 100 + 5;
const int INF = (1 << 29);

int N;
int A[NMAX][NMAX];

int main() {
    int i, j, k;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d", &N);

    for(i = 1; i <= N; i++)
        for(j = 1; j <= N; j++) {
            scanf("%d", &A[i][j]);
            if(!A[i][j])
                A[i][j] = INF;
        }

    for(k = 1; k <= N; k++)
        for(i = 1; i <= N; i++)
            for(j = 1; j <= N; j++)
                if(i != j && i != k && j != k)
                    A[i][j] = min(A[i][j], A[i][k] + A[k][j]);

    for(i = 1; i <= N; i++, printf("\n"))
        for(j = 1; j <= N; j++) {
            if(A[i][j] == INF)
                A[i][j] = 0;
            printf("%d ", A[i][j]);
        }

    return 0;
}