#include <fstream>
#include<vector>
#include<utility>
#include<queue>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int x,a[101][101],i,n,aux,aux2;
vector<pair<int,int> > v[101];
class compara
{
    public:
    bool operator ()(int x,int y)
    {
        return a[i][x]>a[i][y];
    }
};
priority_queue <int,vector<int >, compara> q;
int main()
{
    fin>>n;
    for(i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
        {
            fin>>x;
            if(x!=0)
                v[i].push_back(make_pair(j,x));
        }
           for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
        a[i][j]=500000000;
    for(i=1; i<=n; i++)
    {
        q.push(i);
        a[i][i]=0;
        while(!q.empty())
        {
            aux=q.top();
            q.pop();
            for(vector<pair<int,int> >::iterator j=v[aux].begin(); j!=v[aux].end(); j++)
            {
                aux2=a[i][aux]+j->second;
                if(a[i][j->first]>aux2)
                {
                    a[i][j->first]=aux2;
                    q.push(j->first);
                }
            }
        }
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            fout<<a[i][j]<<' ';
        fout<<'\n';
    }
    return 0;
}