#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
using namespace std;

const string file = "royfloyd";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f;

vector<vector<int> > F;
int N;
int main()
{
	fstream fin(infile.c_str(), ios::in);
	fin >> N;
	F.resize(N, vector<int>(N, 0));

	for(int i = 0; i < N; i++)
	{
		for(int j = 0; j < N; j++)
		{
			fin >> F[i][j];
		}
	}


	fin.close();


	for(int i = 0; i < N; i++)
	{
		for(int j = 0; j < N; j++)
		{
			if(F[i][j] == 0)
				F[i][j] = INF;
		}
	}

	for(int i = 0 ; i < N; i++)
	{
		F[i][i] = 0;
	}

	


	for(int k = 0; k < N; k++)
	{
		for(int i = 0; i < N; i++)
		{
			for(int j = 0; j < N; j++)
			{
				if(F[i][k] + F[k][j] < F[i][j])
				{
					F[i][j] = F[i][k] + F[k][j];
				}
			}
		}
	}


	fstream fout(outfile.c_str(), ios::out);
	for(int i = 0; i < N; i++)
	{
		for(int j = 0; j < N; j++)
		{
			if(F[i][j] == INF)
			{
				fout << 0 << " ";
			}
			else
			{
				fout << F[i][j] << " ";
			}
		}
		fout << "\n";
	}
	fout.close();
}