import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

n = II()
abc = []
for _ in range(n):
    aa = LI()
    aa.sort()
    abc.append(aa)
# print(abc)

def tohwt(i, j):
    a, b, c = abc[i]
    if j == 0: return a, b, c
    if j == 1: return a, c, b
    return b, c, a

dp = [[[0]*3 for _ in range(n)] for _ in range(1 << n)]
for i in range(n):
    for j in range(3):
        dp[1 << i][i][j] = tohwt(i, j)[2]

def chmax(s, i, j, val):
    if val > dp[s][i][j]: dp[s][i][j] = val

ans = 0
for s in range(1 << n):
    for i in range(n):
        for j in range(3):
            H, W, T = tohwt(i, j)
            pre = dp[s][i][j]
            ans = max(ans, pre)
            for ni in range(n):
                if s >> ni & 1: continue
                for nj in range(3):
                    h, w, t = tohwt(ni, nj)
                    if h > H or w > W: continue
                    chmax(s | 1 << ni, ni, nj, pre+t)

print(ans)