Floyd

n = int(input())
d = [ 0 ] *n
for i in range(n):
    d[i] = list ( map( int, input().split() ) )

for k in range(n):
    for i in range(n):
        for  j in range(n):
            d[i][j] = min( d[i][j], d[i][k]+d[k][j])

for i in range(n):
    print(*d[i])