#include <iostream>
#include <fstream>
using namespace std;

const int NMAX = 257;
const int INF = 0x3F3F3F3F;

int n, a[NMAX][NMAX], d[NMAX][NMAX];

ifstream f("rf.in");
ofstream g("rf.out");

void citire()
{
    int i, j;
    f >> n;
    for(i = 1; i <= n; i++)
        for(j = 1; j <= n; j++)
        {
            f >> a[i][j];
            d[i][j] = 1;
        }
    //
    for(i = 1; i <= n; i++)
        d[i][i] = 0;
}

void roy()
{
    int i, j, k;
    for(k = 1; k <= n; k++)
        for(i = 1; i <= n; i++)
            for(j = 1; j <= n; j++)
                if(a[i][k] + a[k][j] < a[i][j])
                {
                    a[i][j] = a[i][k] + a[k][j];
                    d[i][j] = d[i][k] + d[k][j];
                }
                else
                    if(a[i][k] + a[k][j] == a[i][j])
                        d[i][j] = max(d[i][j], d[i][k] + d[k][j]);
}

void afis(int v[][NMAX])
{
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
            if(v[i][j] != INF) g << v[i][j] << ' ';
            else g << 0 << ' ';
        g << '\n';
    }
}

int main()
{
    citire();
    roy();
    afis(a);
    afis(d);
    f.close();
    g.close();
    return 0;
}