#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e2;
const int INF = 0x3f3f3f3f;

int dist[MAXN][MAXN];

int main()
{
    int n;
    ifstream fin("royfloyd.in");
    fin >> n;
    for (int i = 0; i < n; ++i)
      for (int j = 0; j < n; ++j) {
        fin >> dist[i][j];
        if (dist[i][j] == 0)
          dist[i][j] = INF;
      }
    fin.close();
    for (int k = 0; k < n; ++k)
      for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
          if ((i ^ j) && dist[i][j] > dist[i][k] + dist[k][j])
            dist[i][j] = dist[i][k] + dist[k][j];
    ofstream fout("royfloyd.out");
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        if (dist[i][j] == INF)
          dist[i][j] = 0;
        fout << dist[i][j] << " ";
      }
      fout << '\n';
    }
    fout.close();
    return 0;
}