n=int(input())

dp0=[-1]*(n+1)
dp1=[-1]*(n+1)
dp2=[-1]*(n+1)
dp0[0]=0
dp1[0]=0
dp2[0]=0

for v in range(1,n+1)[::-1]:
  ndp0=[-1]*(n+1)
  ndp1=[-1]*(n+1)
  ndp2=[-1]*(n+1)
  a=list(map(int,input().split()))
  for i in range(n):
    if dp0[i]!=-1:
      p=min(n,max(0,i+a[1]-1))
      if p!=n:
        ndp1[p]=max(ndp1[p],dp0[i]+i+a[1])
      else:
        ndp1[n]=max(ndp1[n],dp0[i]+(i+a[1]-1)*v+1)
      p=min(n,max(0,i+a[2]-1))
      if p!=n:
        ndp2[p]=max(ndp2[p],dp0[i]+i+a[2])
      else:
        ndp2[n]=max(ndp2[n],dp0[i]+(i+a[2]-1)*v+1)

    if dp1[i]!=-1:
      p=min(n,max(0,i+a[0]-1))
      if p!=n:
        ndp0[p]=max(ndp0[p],dp1[i]+i+a[0])
      else:
        ndp0[n]=max(ndp0[n],dp1[i]+(i+a[0]-1)*v+1)
      p=min(n,max(0,i+a[2]-1))
      if p!=n:
        ndp2[p]=max(ndp2[p],dp1[i]+i+a[2])
      else:
        ndp2[n]=max(ndp2[n],dp1[i]+(i+a[2]-1)*v+1)

    if dp2[i]!=-1:
      p=min(n,max(0,i+a[0]-1))
      if p!=n:
        ndp0[p]=max(ndp0[p],dp2[i]+i+a[0])
      else:
        ndp0[n]=max(ndp0[n],dp2[i]+(i+a[0]-1)*v+1)
      p=min(n,max(0,i+a[1]-1))
      if p!=n:
        ndp1[p]=max(ndp1[p],dp2[i]+i+a[1])
      else:
        ndp1[n]=max(ndp1[n],dp2[i]+(i+a[1]-1)*v+1)
    
  if dp0[n]!=-1:
    ndp1[n]=max(ndp1[n],dp0[n]+(a[1]-1)*v+1)
    ndp2[n]=max(ndp2[n],dp0[n]+(a[2]-1)*v+1)

  if dp1[n]!=-1:
    ndp0[n]=max(ndp0[n],dp1[n]+(a[0]-1)*v+1)
    ndp2[n]=max(ndp2[n],dp1[n]+(a[2]-1)*v+1)

  if dp2[n]!=-1:
    ndp1[n]=max(ndp1[n],dp2[n]+(a[1]-1)*v+1)
    ndp0[n]=max(ndp0[n],dp2[n]+(a[0]-1)*v+1)
    

  dp0=ndp0
  dp1=ndp1
  dp2=ndp2
  
print(max(max(dp0),max(dp1),max(dp2)))