/**
TAGS: dynamic programming
TESTED ON: http://www.infoarena.ro/problema/royfloyd
**/
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <bitset>
#include <utility>

#define rep(i,a,b) for(int i=int(a); i<=int(b); ++i)
#define rev(i,b,a) for(int i=int(b); i>=int(a); --i)
#define rec(i,a,b,c) for(int i=int(a); i<=int(b); i+=int(c))
#define recv(i,a,b,c) for(int i=int(a); i>=int(b); i-=int(c))
#define mp(x,y) make_pair((x),(y))
#define pb(x) push_back(x)
#define all(c) c.begin(), c.end()
#define tr(container, it) for(auto it=(container).begin(); it != (container).end(); ++it)
#define sqr(x) ((x)*(x))
#define sz(a) int((a).size())
#define mod(a,n) ((a) < 0 ? ((n)+(a)) : ((a)%(n)))
using namespace std;

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;

const int INF = int(1e10);

int main(){

  ifstream fin("royfloyd.in");
  ofstream fout("royfloyd.out");

  int n;
  fin >> n;
  vector<vector<int> > M(n, vector<int>(n,0));
  rep(i,0,n-1)
    rep(j,0,n-1){
      fin >> M[i][j];
      if(i == j)
        M[i][j] = 0;
      }

  // roy floyd. no negative cycle detection break
  rep(k,0,n-1)
    rep(i,0,n-1)
      rep(j,0,n-1)
        M[i][j] = min(M[i][j], M[i][k] + M[k][j]);


  rep(i,0,n-1){
    rep(j,0,n-1)
      if(M[i][j] >= INF)
        fout << 0 << " ";
      else
        fout << M[i][j] << " ";
    fout << "\n";
  }

  return 0;
}