n = int(input())
ABC = [list(map(int,input().split())) for i in range(n)]

dp = [[[0]*3 for i in range(n)] for j in range(1<<n)]
for i,(a,b,c) in enumerate(ABC):
    dp[1<<i][i][0] = c
    dp[1<<i][i][1] = b
    dp[1<<i][i][2] = a

ans = 0
for bit in range(1<<n):
    for j in range(n):
        a,b,c = ABC[j]
        for k in range(3):
            h = dp[bit][j][k]
            
            ans = max(ans,h)
            if h == 0:
                continue

            for t in range(n):
                if bit >> t & 1:
                    continue

                if k == 0:
                    x,y = a,b
                elif k == 1:
                    x,y = a,c
                else:
                    x,y = b,c
                

                na,nb,nc = ABC[t]
                if (na <= x and nb <= y) or (na <= y and nb <= x):
                    dp[bit|1<<t][t][0] = max(dp[bit|1<<t][t][0],h+nc)

                if (na <= x and nc <= y) or (na <= y and nc <= x):
                    dp[bit|1<<t][t][1] = max(dp[bit|1<<t][t][1],h+nb)
                if (nb <= x and nc <= y) or (nb <= y and nc <= x):
                    dp[bit|1<<t][t][2] = max(dp[bit|1<<t][t][2],h+na)

print(ans)