MOD = 10 ** 9 + 7
INF = 10 ** 13
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)

def main():
    N = int(input())
    cube = [tuple(map(int,input().split())) for _ in range(N)]
    
    L = (1<<N)
    dp = [[-1]*(3*N) for _ in range(L)]
    for i in range(N):
        for k,v in enumerate(cube[i]):
            dp[1<<i][3*i + k] = v
    
    for s in range(1,L - 1):
        flag = []
        non_flag = []
        for i in range(N):
            if (s>>i)&1: 
                flag.append(i)
            else:
                non_flag.append(i)
        for i in flag:
            for k in range(3):
                if dp[s][3*i + k] < 0:
                    continue
                a = cube[i][(k + 1)%3]
                b = cube[i][(k + 2)%3]
                for j in non_flag:
                    for l in range(3):
                        c = cube[j][(l + 1)%3]
                        d = cube[j][(l + 2)%3]
                        if (a >= c and b >= d) or (b >= c and a >= d):
                            dp[s^(1<<j)][3*j + l] = max(dp[s^(1<<j)][3*j + l],dp[s][3*i + k] + cube[j][l])
    #print(dp)
    print(max(max(dp[i]) for i in range(L)))
if __name__ == '__main__':
    main()