#include <fstream>
#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;
const int INF = 99999;


int main() {
	int n;
	ifstream in("royfloyd.in");
	
	in >> n;
	
	int dp[n+1][n+1];
	
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= n; ++j) {
			in >> dp[i][j];
			if(i != j && dp[i][j] == 0) {
				dp[i][j] = INF;
			}
		}
	}
	
	in.close();
	
	for(int k = 1; k <= n; ++k) {
		for(int i = 1; i <= n; ++i) {
			for(int j = 1; j <= n ; ++j) {
				if(dp[i][j] > dp[i][k] + dp[k][j])
					dp[i][j] = dp[i][k] + dp[k][j];
			}
		}
	}
	
	ofstream out("royfloyd.out");
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= n; ++j) {
			if(dp[i][j] == INF)
				out << "0" << " ";
			else
				out << dp[i][j] << " ";
		}
		out << '\n';
	}
	out.close();
}