import sys
sys.setrecursionlimit(10 ** 5)


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


def solve(bit_state, i):
    if (bit_state, i) in memo:
        return memo[bit_state, i]
    if sum(bit_state) == 1:
        memo[bit_state, i] = 0
        return 0
    res = 10 ** 18
    for prv_i in range(n):
        if prv_i == i:
            continue
        if bit_state[prv_i] == 0:
            continue
        else:
            prv_state = list(bit_state)
            prv_state[i] -= 1
            res = min(res, solve(tuple(prv_state), prv_i) + cost[prv_i][i])
    memo[bit_state, i] = res
    return memo[bit_state, i]


ans = 10 ** 18
memo = {}
for i in range(n):
    for j in range(n):
        if i == j:
            bit_state = [2] * n
            res = solve(tuple(bit_state), i)
            ans = min(res, ans)
        else:
            bit_state = [2] * n
            bit_state[j] = 0
            res = solve(tuple(bit_state), i)
            ans = min(res + cost[i][j], ans)
print(ans)