#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

const int NMAX = 105;
const long long INF = 1e10;

ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");

long long dp[NMAX][NMAX];

int main() {
    int n;
    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] == 0)
                dp[i][j] = INF;
        }
    }
    for(int k = 1; k <= n; ++k) {
        for(int i = 1; i <= n; ++i) {
            for(int j = 1; j <= n; ++j) {
                if(i != j) {
                    dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
                }
            }
        }
    }
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= n; ++j) {
            cout << dp[i][j] << " ";
        }
        cout << "\n";
    }
    return 0;
}