#include <algorithm>
#include <stdio.h>

using namespace std ;

int a[101][101] ;
int b[101][101] ;
int minim(int A,int B) {
  if (A<B) return A ;
  return B ;
}

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

  int n ;

  scanf ("%d" , &n) ;

  for(int i=1; i<=n; ++i) {
    for(int j=1 ; j<=n ; ++j) {
      scanf("%d" , &a[i][j]) ;
    }
  }

  for (int k=1;k<=n;++k) {
    for (int i=1;i<=n;++i) {
      for (int j=1 ; j<=n ; ++j) {
        b[i][j]=minim(a[i][j],a[i][k]+a[k][j]) ;
      }
    }
  }
  for (int i=1;i<=n ; ++i) {
    for(int j=1 ; j<=n ; ++j) {
      printf ("%d " , b[i][j] ) ;
    }
    printf ("\n");
  }


  return 0 ;
}