n=int(input())
a=[list(map(int,input().split())) for i in range(n)]
for i in range(n):
	for j in range(n):
		for k in range(n):
			a[j][k]=min(a[j][i]+a[i][k],a[j][k])
dp=[[1<<60]*n for i in range(1<<n)]
dp[1][0]=0
for i in range(1,1<<n):
	m=n
	for j in range(n):
		m-=i>>j&1
	for j in range(n):
		if i>>j&1==0:
			continue
		for l in range(n):
			if i>>l&1:
				continue
			dp[i|1<<l][l]=min(dp[i|1<<l][l],dp[i][j]+a[j][l]*m)
print(min(dp[-1]))