#include <fstream>

using namespace std;

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

const int max_size = 1e2 + 3;

int dp[max_size][max_size];

int main ()
{
    int n;
    in >> n;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            in >> dp[i][j];
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            for (int k = 1; k <= n; k++)
            {
                if (dp[j][i] == 0 || dp[i][k] == 0 || k == j)
                {
                    continue;
                }
                if (dp[j][k] == 0)
                {
                    dp[j][k] = dp[j][i] + dp[i][k];
                }
                dp[j][k] = min(dp[j][k], dp[j][i] + dp[i][k]);
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            out << dp[i][j] << " ";
        }
        out << '\n';
    }
    in.close();
    out.close();
    return 0;
}