//
//  main.cpp
//  Algoritmul lui Roy-Floyd
//
//  Created by Andrei Constantinescu on 18.04.2013.
//  Copyright (c) 2013 Andrei Constantinescu. All rights reserved.
//

#include <fstream>

#define MAX 5000
using namespace std;

int n, a[105][105];

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

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

void royfloyd() {
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j =1; j <= n; j++)
                if (a[i][k]!=0 && a[k][j]!=0 && i!=j)
                    if (a[i][j]>a[i][k]+a[k][j] || a[i][j]==0) a[i][j]=a[i][k]+a[k][j];
}

void afisare() {
    for (int i = 1; i <= n; i++) {
        for (int j =1; j <= n; j++)
            if (a[i][j] < MAX)
                g << a[i][j] << " ";
        g<< endl;
    }
}

int main() {
    citire();
    royfloyd();
    afisare();
    g.close();
}