n=int(input())
d=[list(map(int,input().split())) for i in range(n)]
X=10**10
q=[[X]*n for i in range(1<<n)]
q[1<<0][0]=0
for i in range(1,1<<n):
  for j in range(n):
    if (i>>j)&1==1:
      for k in range(n):
        if (i>>k)&1==0:
          q[i|(1<<k)][k]=min(q[i|(1<<k)][k],q[i][j]+d[j][k]*(n-i.bit_count()))
print(min(q[-1]))