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

inf = 10 ** 11
ans = 10 ** 11
import heapq
def pack(S,T,j):
    return (S << 13) + (T << 4) + j
def unpack(z):
    S = z >> 13
    z %= (1 << 13)
    T = z >> 4
    j = z % (1 << 4)
    return (S,T,j)
if True:
    dp = [[[inf] * N for _ in range(1 << N)] for _ in range(1 << N)]
    q = []
    for i in range(N):
        dp[1 << i][0][i] = 0
        q.append((0,pack(1 << i,0,i)))
    while q:
        d,z = heapq.heappop(q)
        S,T,last = unpack(z)
        if S == (1 << N) - 1:break
        maskl = 1 << last
        for j in range(N):
            maskj = 1 << j
            if S & maskj:continue
            if T & maskl:
                if dp[S | maskj][T][j] > d + c[last][j]:
                    dp[S | maskj][T][j] = d + c[last][j]
                    heapq.heappush(q,(d + c[last][j],pack(S|maskj,T,j)))
            else:
                bit =(S | maskj) ^ maskl
                if dp[bit][T | maskl][j] > d + c[last][j]:
                    dp[bit][T | maskl][j] = d + c[last][j]
                    heapq.heappush(q,(d + c[last][j],pack(bit,T | maskl,j)))
    _min = inf
    for T in range(1 << N):
        for j in range(N):
            if dp[-1][T][j] < _min:
                _min = dp[-1][T][j]
    if _min < ans:
        ans = _min
print(ans)