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

def dist(u,v):
    return X[u][v]


dp = [[10**18]*N for _ in range(3**N)]
for v in range(N):
    dp[3**v][v] = 0
for b in range(1, 3**N):
    for v in range(N):
        vb = (b//(3**v))%3
        if not vb: 
            continue
        for u in range(N):
            ub = (b//(3**u))%3
            if not ub:
                continue
            if u==v:
                if b+1 == 3**N and vb == 2:
                    dp[b][v] = min(dp[b][v], dp[b-3**v][u] + dist(u, v))
                continue
            dp[b][v] = min(dp[b][v], dp[b-3**v][u] + dist(u, v))


print(min(dp[3**N-1]))