n = int(input())
dp = [[-(1 << 60)] * (n + 1) for _ in range(3)]
dp[0][0] = dp[1][0] = dp[2][0] = 0

for t in range(n):
    A = list(map(int, input().split()))
    ndp = [[-(1 << 60)] * (n + 1) for _ in range(3)]
    for i1 in range(3):
        for i2 in range(3):
            if i1 == i2:
                continue

            for j in range(n):
                nj = j + A[i2]
                nv = dp[i1][j]
                if nj > n:
                    nv += (n - t) * (nj - n)
                    nj = n

                nv += nj
                nj = max(nj - 1, 0)
                ndp[i2][nj] = max(ndp[i2][nj], nv)
    dp = ndp

print(max(max(row) for row in dp))