n=int(input())
b=[list(map(int,input().split())) for i in range(n)]
q=[[[0]*3 for j in range(n)] for i in range(1<<n)]
for i in range(n):
  for j in range(3):
    q[1<<i][i][j]=b[i][j]
for i in range(1<<n):
  for j1 in range(n):
    for k1 in range(3):
      for j2 in range(n):
        for k2 in range(3):
          if (i>>j1)&1==1 and (i>>j2)&1==0:
            b1=b[j1][:]
            b1.pop(k1)
            b2=b[j2][:]
            b2.pop(k2)
            if min(b1)<=min(b2) and max(b1)<=max(b2):
              q[i|(1<<j2)][j2][k2]=max(q[i|(1<<j2)][j2][k2],q[i][j1][k1]+b[j2][k2])
h=0
for i in range(1<<n):
  for j in range(n):
    for k in range(3):
      h=max(h,q[i][j][k])
print(h)