#include <iostream>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <vector>
#include <string>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <iomanip>

using namespace std;

#define ll long long

const int NMAX = 105;
const int INF = 0x3f3f3f3f;

int n;
int adjacentMatrix[NMAX][NMAX];

// Global variables

void ReadData() {
    cin >> n;
    for(int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            cin >> adjacentMatrix[i][j];
            if (adjacentMatrix[i][j] == 0 && i != j){
                adjacentMatrix[i][j] = INF;
            }
            
        }
    }
}

void Solve() {
    for (int k = 0; k < n; k++){
        for (int i = 0; i < n ; i++){
            for (int j = 0; j < n; j++){
                adjacentMatrix[i][j] = min(adjacentMatrix[i][j], adjacentMatrix[i][k] + adjacentMatrix[k][j]);
            }
        }
    }

    for (int i = 0; i < n ; i++){
        for (int j = 0; j < n; j++){
            if (adjacentMatrix[i][j] == INF)
                cout << 0 << " ";
            else
                cout << adjacentMatrix[i][j] << " ";
        }
        cout << "\n";
    }

}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

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

    int t = 1;
    // cin >> t; // Uncomment for multiple test cases
    while (t--) {
        ReadData();
        Solve();
    }
    return 0;
}