/// Aceasta sursa este pentru problema
/// https://www.infoarena.ro/problema/royfloyd
/// Punctaj: 100
/// Grupa Medie (pt seniori)

#include<fstream>
#include<iostream>
#include<climits>
#include<algorithm>
#include<cstring>
#include<cmath>
#include <vector>
#include <queue>

#define MAX 100
#define INF 1005

using namespace std;

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

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

int n;
int a[MAX+5][MAX+5];

int main(){

    f>>n;

    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            f>>a[i][j];
            if(a[i][j] == 0 && i!=j){
                a[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(a[i][j] > a[i][k] + a[k][j]){
                    a[i][j] = a[i][k] + a[k][j];
                }
            }
        }
    }

    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            g<<a[i][j]<<" ";
        }
        g<<'\n';
    }

    f.close();
    g.close();
    return 0;
}