#include <cstdio>
#include <algorithm>
using namespace std;
const int NMAX = 105;
const int INF = 0x3f3f3f3f;
int n, A[NMAX][NMAX];

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", &A[i][j]);
      if (!A[i][j]) A[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)
          A[i][j] = min(A[i][j], A[i][k] + A[k][j]);
        
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (j > 1) printf(" ");
      printf("%d", A[i][j] == INF ? 0 : A[i][j]);
    }
    printf("\n");
  }
  return 0;
}