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

dp = [[10**18 for i in range(2**(2*N))] for j in range(N)]

for i in range(N):
    dp[i][2**(2*N)-1] = 0
    dp[i][2**(2*N)-1-2**(i+N)] = 0

for j in range(2**(2*N)-1,-1,-1):
    for i in range(N):
        for k in range(N):
            if not j>>k & 1:
                dp[i][j] = min(dp[k][j+2**k] + c[i][k],dp[i][j])
        for k in range(N,2*N):
            if (not j>>k & 1) and i!=k-N and j>>(k-N) & 1:
                dp[i][j] = min(dp[k-N][j+2**k] + c[i][k-N],dp[i][j])

res = 10**18
for i in range(N):
    res = min(res,dp[i][2**i])

print(res)