#include <stdio.h>
#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <deque>
using namespace std;
int t[110][110],n,i,j,k;
int main(){
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++)
    for (j=1;j<=n;j++)
    scanf("%d",&t[i][j]);
for (k=1;k<=n;k++)
   for (i=1;i<=n;i++)
      for (j=1;j<=n;j++)
       if (i!=j && t[i][k]>0 && t[k][j]>0)
       if (t[i][j]==0 || t[i][j]>t[i][k]+t[k][j]) t[i][j]=t[i][k]+t[k][j];
for (i=1;i<=n;i++){
    for (j=1;j<=n;j++) printf("%d ",t[i][j]);
printf("\n");
}
return 0;
}