N = int(input())
D = []
for i in range(N):
    D.append(list(map(int, input().split())))
    
N2 = 1 << N
inf = 10 ** 18
dp = [[-inf] * (N * 3) for i in range(N2)]
ans = 0
for i in range(N):
    for k in range(3):
        dp[1 << i][i * 3 + k] = D[i][k]
        ans = max(ans, dp[1 << i][i * 3 + k])

def check(i, j, a, b):
    if i[(a + 1) % 3] <= j[(b + 1) % 3] and i[(a + 2) % 3] <= j[(b + 2) % 3]:
        return True
    if i[(a + 2) % 3] <= j[(b + 1) % 3] and i[(a + 1) % 3] <= j[(b + 2) % 3]:
        return True
    return False
   

for s in range(1, N2):
    dps = dp[s]
    for p in range(3 * N):
        q, r = divmod(p, 3)
        Dq = D[q]
        if (s >> q) & 1 == 0:
            continue
        for i in range(N):
            if (s >> i) & 1:
                continue
            Di = D[i]
            for k in range(3):
                if check(Dq, Di, r, k):
                    dp[s | (1 << i)][3 * i + k] = max(dp[s | (1 << i)][3 * i + k], dps[p] + Di[k])
                    ans = max(ans, dp[s | (1 << i)][3 * i + k])

print(ans)