import sys
input = sys.stdin.readline

N=int(input())
D=[list(map(int,input().split())) for i in range(N)]

DP=[[1<<60]*(1<<N) for i in range(N)]
DP[0][1<<0]=0

for i in range(1<<N):
    b=i.bit_count()
    plus=N-b
    for j in range(N):
        if i & (1<<j) == 0:
            continue

        for k in range(N):
            if DP[k][i|(1<<k)]>DP[j][i]+plus*D[j][k]:
                DP[k][i|(1<<k)]=DP[j][i]+plus*D[j][k]

ANS=1<<60

for i in range(N):
    ANS=min(ANS,DP[i][(1<<N)-1])

print(ANS)