#include <iostream>
#include <queue>
#include <fstream>
using namespace std;
#define NMAX 1000
#define INF 9999999
int n;
int d[NMAX][NMAX];
int main() {
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
f >> d[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
d[i][j] = d[i][j] < d[i][k] + d[k][j] ? d[i][j] : d[i][k] + d[k][j];
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
g << d[i][j] << " ";
}
g << endl;
}
return 0;
}