#include <fstream>

#define Nmax 105

using namespace std;

int N, Distance[Nmax][Nmax];

void Solve() {

    int i, j, k;

    for(k = 1; k <= N; k++)
        for(i = 1; i <= N; i++)
            for(j = 1; j <= N; j++)
                if(Distance[i][k] != 0 && Distance[k][j] != 0 && (Distance[i][j] == 0 || Distance[i][j] > Distance[i][k] + Distance[k][j]))
                    Distance[i][j] = Distance[i][k] + Distance[k][j];

}
void Read() {

    int i, j;
    ifstream in("royfloyd.in");
    in >> N;

    for(i = 1; i <= N; i++)
        for(j = 1; j <= N; j++)
            in >> Distance[i][j];

    in.close();
}
void Write() {

    int i, j;
    ofstream out("royfloyd.out");

    for(i = 1; i <= N; i++) {
        for(j = 1; j <= N; j++)
            out << Distance[i][j] << ' ';
        out << '\n';
    }

    out.close();
}
int main() {

    Read();
    Solve();
    Write();

    return 0;
}