#include <bits/stdc++.h>

using namespace std;

//roy floyd
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int p[101][101];

int main() {
    int n;
    f >> n;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++){
          f >> p[i][j];
          if (p[i][j] == 0 && i != j)
                p[i][j] = INT_MAX;
            }

    for (int k=1; k<=n; k++)
        for (int i=1; i<=n; i++)
            for (int j=1; j<=n; j++)
              if (p[i][k] != INT_MAX && p[k][j] != INT_MAX)
                    p[i][j] = min(p[i][j], p[i][k] + p[k][j]);

   for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (p[i][j] == INT_MAX) g << 0 << " ";
            else g << p[i][j] << " ";
        }
        g << "\n";
    }
    return 0;
}