#include <iostream>

using namespace std;

const int MAX_N = 505;
const int INF = (1 << 20);

int n;

int G[MAX_N][MAX_N];

int main() {
  freopen("royfloyd.in", "r", stdin);
  freopen("royfloyd.out", "w", stdout);
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      scanf("%d", &G[i][j]);
      if (G[i][j] == 0) {
        G[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 (G[i][k] + G[k][j] < G[i][j]) {
          G[i][j] = G[i][k] + G[k][j];
        }
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      if (G[i][j] == INF || i == j) {
        G[i][j] = 0;
      }
      printf("%d ", G[i][j]);
    }
    printf("\n");
  }
  return 0;
}