#include <bits/stdc++.h>
using namespace std;
#define INF 1e9
int Ad[105][105],Dp[105][105];
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",&Ad[i][j]);
            if(i!=j&&Ad[i][j]==0)
                Dp[i][j]=INF;
            else Dp[i][j]=Ad[i][j];
        }
    for(int k=1;k<=n;++k)
        for(int i=1;i<=n;++i)
            for(int j=1;j<=n;++j)
                Dp[i][j]=min(Dp[i][j],Dp[i][k]+Dp[k][j]);
    for(int i=1;i<=n;++i){
        for(int j=1;j<=n;++j)
            printf("%d ",Dp[i][j]);
        printf("\n");
    }
	return 0;
}