// Template v2
#define pb push_back
#define mp make_pair
#define first x
#define second y
#define l(x) x<<1
#define r(x) x<<1 | 1
#define lsb(x) x & -x
#include<fstream>
#include<vector>
#include<iomanip>
#include<algorithm>
#include <bitset>
using namespace std;
  
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PKK;
// primes less than 100
const int PRIM[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
const int CMAX = 10005;
const int MOD = 1000000007;
const int NMAX = 105;
const int LOGMAX = log2(250666)+8;
const short INF16 = 32000;
const int INF = 2*1e9 + 6661369;
const LL INF64 = LL(1e18);
const LD EPS = 1e-9, PI = acos(-1.0);
const int dx[]={-1,1,0,0};
const int dy[]={0,0,1,-1};


ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");


int n;
int dp[NMAX][NMAX];

void read()
{
    cin>>n;
    for(int i=1; i<=n; ++i)
        for(int j=1; j<=n; ++j)
        {
            cin>>dp[i][j];
            if(!dp[i][j]) dp[i][j]=INF;
        }

    for(int k=1; k<=n; ++k)
        for(int i=1; i<=n; ++i)
            for(int j=1; j<=n; ++j)
                if(i!=j)
                    dp[i][j]=min(dp[i][j], dp[i][k]+dp[k][j]);
                    
    for(int i=1; i<=n; ++i, cout<<"\n")
        for(int j=1; j<=n; ++j)
            cout<<((dp[i][j]!=INF)?dp[i][j]:0)<<" ";
    
}
 
int main(){
    cout<<setprecision(4)<<fixed;
    read();
      
    return 0;
}