#include <bits/stdc++.h>
#define int long long

using namespace std;

const int NMAX = 260;
int dp[NMAX][NMAX];
int maxx[NMAX][NMAX];

signed main()
{
    ifstream cin("rf.in");
    ofstream cout("rf.out");
    int n;
    cin>>n;

    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            {
                cin>>dp[i][j];
                if(dp[i][j] != 0)
                    maxx[i][j] = 1;
                if(dp[i][j] == 0)
                    dp[i][j] = 21e8;
            }

    for(int j=1; j<=n; j++)
        for(int i=1; i<=n; i++)
            for(int k=1; k<=n; k++)
            {
                if(dp[i][j] + dp[j][k] < dp[i][k])
                {
                    dp[i][k] = dp[i][j] + dp[j][k];
                    maxx[i][k] = maxx[i][j] + maxx[j][k];
                }
                else if(dp[i][j] + dp[j][k] == dp[i][k])
                    maxx[i][k] = max(maxx[i][k], maxx[i][j] + maxx[j][k]);
            }

    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++)
        {
            if(dp[i][j] > 21e8 || i == j)
                dp[i][j] = 0;
            cout<<dp[i][j]<<" ";
        }
        cout<<'\n';
    }

    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++)
        {
            if(i==j) cout<<0<<" ";
            else cout<<maxx[i][j]<<" ";
        }
        cout<<'\n';
    }


    return 0;
}