#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>

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

using namespace std;

typedef long long int64;

const int oo = 0x3f3f3f3f;

int V;
vector< vector<int> > Cost;

void RoyFloyd(vector< vector<int> > &distances) {
    int v = int(distances.size());
    for (int k = 0; k < v; ++k)
        for (int i = 0; i < v; ++i)
            for (int j = 0; j < v; ++j)
                distances[i][j] = min(distances[i][j], distances[i][k] + distances[k][j]);
}

void Solve() {
    RoyFloyd(Cost);
}

void Read() {
    cin >> V;
    Cost = vector< vector<int> >(V, vector<int>(V));
    for (int x = 0; x < V; ++x) {
        for (int y = 0; y < V; ++y) {
            cin >> Cost[x][y];
            if (Cost[x][y] == 0)
                Cost[x][y] = oo;
            if (x == y)
                Cost[x][y] = 0;
        }
    }
}

void Print() {
    for (int x = 0; x < V; ++x) {
        for (int y = 0; y < V; ++y) {
            if (Cost[x][y] == oo)
                Cost[x][y] = 0;
            cout << Cost[x][y] << " ";
        }
        cout << "\n";
    }
}

int main() {
    assert(freopen("royfloyd.in", "r", stdin));
    assert(freopen("royfloyd.out", "w", stdout));
    Read();
    Solve();
    Print();
    return 0;
}