//ALEXANDRU MICLEA

#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>
#include <chrono>
#include <assert.h>

using namespace std;
using ll = long long;

#include <fstream>
//ifstream cin("input.in"); ofstream cout("output.out");
ifstream cin("royfloyd.in"); ofstream cout("royfloyd.out");

//VARIABLES

int gr[105][105];
const int INF = 1e9;

//FUNCTIONS



//MAIN

int main() {

    int n; cin >> n;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            cin >> gr[i][j];
            if (gr[i][j] == 0) gr[i][j] = INF;
        }
    }

    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            if (i == k || gr[i][k] == INF) continue;
            for (int j = 1; j <= n; j++) {
                if (i == j || gr[k][j] == INF) continue;
                gr[i][j] = min(gr[i][j], gr[i][k] + gr[k][j]);
            }
        }
    }

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

    return 0;
}