import numpy as np

INF = int(2e9+5)
Max_S = int(1e5)
N = int(input())
fin = int(pow(3,N)-1)
dp = np.full((Max_S,N),INF)
c = []
for i in range(N):
    c.append(list(map(int,input().split())))

def calc(S, v):
    if(dp[S][v] != INF):
        return dp[S][v]
    res = INF
    for u in range(N):
        if(u == v and S != fin):
            continue
        div = int(pow(3,u))
        if(S // div % 3 == 0):
            continue
        new_S = S - int(pow(3,v))
        res = min(res,calc(new_S,u) + c[u][v])
    dp[S][v] = res
    return res

for i in range(N):
    st = int(pow(3,i))
    dp[st][i] = 0
for i in range(N):
    calc(fin,i)
ans = INF
for i in range(N):
    ans = min(ans,dp[fin][i])
print(ans)