N = int(input())
C = [0] * N
for i in range(N):
    C[i] = list(map(int, input().split()))

M = 3 ** N
INF = 10 ** 10
dp = [[INF] * N for i in range(M)]

for i in range(N):
    dp[3**i][i] = 0

for i in range(M):
    for j in range(N):
        for k in range(N):
            if j == k:
                continue
            if (i //(3 ** k)) % 3 == 2:
                continue
            n = i + (3 ** k)
            # print(n, i, k)
            dp[n][k] = min(dp[n][k], dp[i][j] + C[j][k])
    # print(i, dp[i])

ans = min(dp[-1])

for i in range(N):
    t = M-1 - (3 ** i)
    # ans = min(ans, dp[t][N-1-i])
    ans = min(ans, dp[t][i])
    # print(dp[t][i])

print(ans)