#include <bits/stdc++.h>

using namespace std;

const int NMAX = 100;

int n, adj[NMAX + 1][NMAX + 1], dp[NMAX + 1][NMAX + 1];

int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            scanf("%d", &adj[i][j]),
            dp[i][j] = adj[i][j];
    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i) {
            if(!adj[i][k]) continue;
            for(int j = 1; j <= n; ++j) {
                if(!adj[k][j] || i == j) continue;
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
            }
        }
    for(int i = 1; i <= n; ++i, printf("\n"))
        for(int j = 1; j <= n; ++j) printf("%d ", dp[i][j]);
    return 0;
}