#include <bits/stdc++.h>

using namespace std;

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

const int SIZE = 102;
const int INF = 1002;

int n, m, x;
vector<pair<int,int>> a[SIZE];

struct compare
{
    bool operator()(pair<int, int> l, pair<int, int> r)
    {
        return l.second > r.second;
    }
};

priority_queue<pair<int, int>, vector<pair<int,int>>, compare> qu;

void dkst(int stnod)
{
    vector<int> dist(SIZE, INF);
    dist[stnod] = 0;
    qu.push(make_pair(stnod, dist[stnod]));
    while (!qu.empty())
    {
        int nod = qu.top().first;
        int distance = qu.top().second;
        qu.pop();
        if (!(distance > dist[nod]))
        {
            for (auto i: a[nod])
            {
                int vec = i.first;
                int cost = i.second;
                if (cost != 0)
                {
                    if (dist[nod] + cost < dist[vec])
                    {
                        dist[vec] = dist[nod] + cost;
                        qu.push(make_pair(vec, dist[vec]));
                    }
                }
            }
        }
    }
    for (int i = 1; i <= n; i++)
        {
            if (dist[i] == INF)
                fout<<"0"<<" ";
            else
                fout<<dist[i]<<" ";
        }
        fout<<endl;
}


int main()
{
    fin>>n;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            fin>>x;
            a[i].push_back(make_pair(j, x));
        }
    }
    for (int i = 1; i <= n; i++)
    {
        dkst(i);
    }
}