#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
const int MAX_N=100;
const int INF=1e9;

int d[MAX_N][MAX_N];

int main(){
  FILE *fin,*fout;
  int n,i,j,k;
  fin=fopen("royfloyd.in","r");
  fout=fopen("royfloyd.out","w");
  fscanf(fin,"%d",&n);

  for(i=0;i<n;i++){
    for(j=0;j<n;j++){
      fscanf(fin,"%d",&d[i][j]);
      if(d[i][j]==0 && i!=j){
        d[i][j]=INF;
      }
    }
  }

  for(k=0;k<n;k++)
    for(i=0;i<n;i++)
      for(j=0;j<n;j++)
        d[i][j] = min(d[i][j],d[i][k]+d[k][j]);

  for(i=0;i<n;i++){
    for(j=0;j<n;j++){
      if(d[i][j]==INF)
        d[i][j]=0;
      fprintf(fout,"%d ", d[i][j]);
    }
    fprintf(fout,"\n");
  }


  fclose(fin);
  fclose(fout);
  return 0;
}