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

def main():
    N = int(input())
    L = (1<<N)
    cube = [tuple(map(int,input().split())) for _ in range(N)]
    dp = [[[0] * 48 for _ in range(48)] for _ in range(L)]
    for i in range(N):
        for k in range(3):
            a = 3*i + k
            b = 3*i + (k + 1)%3
            dp[1<<i][a][b] = cube[i][(k + 2)%3]

    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):
                a = 3*i + k
                b = 3*i + (k + 1)%3
                for j in non_flag:
                    for l in range(3):
                        x = 3*j + l
                        y = 3*j + (l + 1)%3
                        if ((cube[i][k] <= cube[j][l] and cube[i][(k + 1)%3] <= cube[j][(l + 1)%3]) or 
                           (cube[i][k] <= cube[j][(l + 1)%3] and cube[i][(k + 1)%3] <= cube[j][l])):
                           dp[s^(1<<j)][x][y] = max(dp[s^(1<<j)][x][y],dp[s][a][b] + cube[j][(k + 2)%3])
    #print(dp[-1])
    print(max(max(dp[-1][i]) for i in range(48)))
if __name__ == '__main__':
    main()