#include <cstdio>
#include <algorithm>
using namespace std;
int dp[104][104], n;
int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    scanf("%d\n",&n);
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j){
            scanf("%d",&dp[i][j]);
            if(dp[i][j] == 0 && i!=j)
                dp[i][j] = 1<<30;
        }
    for(int k=1;k<=n;++k)
        for(int i=1;i<=n;++i)
            if(i!=k)
                for(int j=1;j<=n;++j)
                    if(j!=k)
                        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;
}