#include <algorithm>
using namespace std;

#define DIM 105

int best[DIM][DIM];
int n;

void read ()
{
    int i,j;

    scanf ("%d",&n);
    for (i=1; i<=n; ++i)
        for (j=1; j<=n; ++j)
            scanf ("%d",&best[i][j]);
}

void solve ()
{
    int i,j,k;

    for (k=1; k<=n; ++k)
        for (i=1; i<=n; ++i)
            for (j=1; j<=n; ++j)
                if (best[i][k] && best[k][j] && i!=j)
                    if (best[i][k]+best[k][j]<best[i][j] || !best[i][j])
                        best[i][j]=best[i][k]+best[k][j];
}

void print ()
{
    int i,j;

    for (i=1; i<=n; ++i)
    {
        for (j=1; j<=n; ++j)
            printf ("%d ",best[i][j]);
        printf ("\n");
    }
}

int main ()
{
    freopen ("royfloyd.in","r",stdin);
    freopen ("royfloyd.out","w",stdout);

    read ();
    solve ();
    print ();

    return 0;
}