mod = 1000000007
eps = 10**-9
inf = 10**17


def main():
    import sys
    input = sys.stdin.readline

    N = int(input())
    C = []
    for _ in range(N):
        C.append(list(map(int, input().split())))

    dp = [[inf] * (1 << (N*2)) for _ in range(N*2)]
    for i in range(N):
        dp[i][1 << i] = 0
    for state in range(1 << (N*2)):
        for v_last in range(N*2):
            if dp[v_last][state] == inf:
                continue
            for v_new in range(N):
                if not state >> v_new & 1:
                    state_new = state | (1 << v_new)
                    if v_last < N:
                        dp[v_new][state_new] = min(dp[v_new][state_new], dp[v_last][state] + C[v_last][v_new])
                    else:
                        dp[v_new][state_new] = min(dp[v_new][state_new], dp[v_last][state] + C[v_last - N][v_new])
                else:
                    v_new2 = v_new + N
                    if not state >> v_new2 & 1:
                        if v_last + N != v_new2:
                            state_new2 = state | (1 << v_new2)
                            if v_last < N:
                                dp[v_new2][state_new2] = min(dp[v_new2][state_new2], dp[v_last][state] + C[v_last][v_new])
                            else:
                                dp[v_new2][state_new2] = min(dp[v_new2][state_new2],
                                                             dp[v_last][state] + C[v_last - N][v_new])
    if N == 2:
        ans = inf
        for v in range(N, N*2):
            ans = min(ans, dp[v][-1])
        print(ans)
    else:
        ans = inf
        for v in range(N, N*2):
            ans = min(ans, dp[v][-1])
        for vv in range(N):
            ans = min(ans, dp[vv][((1 << (2*N)) - 1) ^ (1 << (vv + N))])
        print(ans)


if __name__ == '__main__':
    main()