#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("royfloyd.in"); ofstream g("royfloyd.out");

int n, a[105][105];

void rf(){
    int i,j,k;
    for(k = 1; k <= n; ++k) {
        for(i = 1; i <= n; ++i) {
            for(j = 1; j <= n; ++j) {
                if(i != j && a[i][k] && a[k][j] && (a[i][k] + a[k][j] < a[i][j] || a[i][j] == 0) ) {
                    a[i][j] = a[i][k] + a[k][j];
                }
            }
        }
    }
}

int main(){
    int i,j;
    f>>n;
    for(i = 1; i <= n; ++i) {
        for(j = 1; j <= n; ++j) {
            f>>a[i][j];
        }
    }
    rf();
    for(i = 1; i <= n; ++i,g<<'\n') {
        for(j = 1; j <= n; ++j) {
            g<<a[i][j]<<' ';
        }
    }
    return 0;
}