#include <bits/stdc++.h>

using namespace std;

int N, dp[205][205];
const int INF = 0x3f3f3f3f;

int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);

    cin.sync_with_stdio(false);

    cin >> N;
    for (int i = 1; i <= N; ++i)
        for (int j = 1; j <= N; ++j)
        {
            cin >> dp[i][j];
            if(i == j)
                dp[i][j] = INF;
        }

    for(int optimise = 1; optimise <= N; ++optimise)
        for(int from = 1; from <= N; ++from)
            if(optimise != from)
                for(int to = 1; to <= N; ++to)
                    if(optimise != to && from != to)
                        dp[from][to] = min(dp[from][to], dp[from][optimise] + dp[optimise][to]);
    for(int i = 1; i <= N; ++i) {
        for(int j = 1; j <= N; ++j)
            if(dp[i][j] < INF)
                cout << dp[i][j] << " ";
            else
                cout << "0 ";
        cout << "\n";
    }


    return 0;
}