#include <fstream>

using namespace std;

ifstream cin ("royfloyd.in");
ofstream cout ("royfloyd.out");

const int INF = 1e9;

const int N = 100;
int a[N + 1][N + 1], dp[N + 1][N + 1];

int n;

int main()
{
    cin >> n;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
        {
            cin >> a[i][j];
            dp[i][j] = a[i][j];
        }
    for (int node = 1; node <= n; ++node)
    {
        for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            dp[i][j] = min (dp[i][j], dp[i][node] + dp[node][j]);
    }
    for (int i = 1; i <= n; ++i, cout << '\n')
        for (int j = 1; j <= n; ++j)
        cout << dp[i][j] << ' ';
    return 0;
}