#include <fstream>
#include <climits>
using namespace std;

int dp[103][103][103];
//dp[i][j][k] = drumul minim intre i si j folosind noduri de la 1 la k ca noduri
//intermediare
//dp[i][j][0] = cost[i][j]
//dp[i][j][k] = min(dp[i][j][k - 1], dp[i][k][k - 1] + dp[k][j][k - 1])
int main()
{
    ifstream cin("royfloyd.in");
    ofstream cout("royfloyd.out");
    int n, k, i, j;
    cin >> n;
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
        {
            cin >> dp[i][j][0];
            if (dp[i][j][0] == 0)
                dp[i][j][0] = INT_MAX / 2;
        }
    for (k = 1; k <= n; k++)
        for (i = 1; i <= n; i++)
            for (j = 1; j <= n; j++)
                if (i != j)
                    dp[i][j][k] = min(dp[i][j][k - 1], dp[i][k][k - 1] + dp[k][j][k - 1]);
    for (i = 1; i <= n; i++, cout << "\n")
        for (j = 1; j <= n; j++)
            cout << dp[i][j][n] << " ";
}