#include <cstdio>
#include <vector>

#define INF 0x3f3f3f3f

std::vector<std::vector<int>> DP;
int N;

int main()
{
  freopen("royfloyd.in", "r", stdin);
  freopen("royfloyd.out", "w", stdout);

  scanf("%d", &N);
  DP.resize(N, std::vector<int>(N, 0));
  for (int i = 0; i < N; ++i)
    for (int j = 0; j < N; ++j) {
      scanf("%d", &DP[i][j]);
      if (i == j || DP[i][j] == 0)
	DP[i][j] = INF;
    }

  for (int k = 0; k < N; ++k) // pick the optimisation node
    for (int i = 0; i < N; ++i)
      if (i != k)
	for (int j = 0; j < N; ++j)
	  if (j != k && j != i)
	    DP[i][j] = std::min(DP[i][j], DP[i][k] + DP[k][j]);

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      if (DP[i][j] >= INF)
	printf("0 ");
      else
	printf("%d ", DP[i][j]);
    }
    printf("\n");
  }
  
  
  return 0;
}