output_description: Print the maximum number of acorns that Chokudai can bring to the nest.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      g_A s_A b_A
      g_B s_B b_B
attempt: N = int(input())
  ca = list(map(int, input().split()))
  cb = list(map(int, input().split()))
  
  ab = [a - b for a, b in zip(ca, cb)]
  ba = [b - a for a, b in zip(ca, cb)]
  
  
  def cal(array, x):
      global N
      init = N
      a, b, c = array
      gx, sx, bx = x
      if a <= 0:
          r0 = 0
      else:
          r0 = init // gx
          init -= gx * r0
      if b <= 0:
          r1 = 0
      else:
          r1 = init // sx
          init -= sx * r1
      if c <= 0:
          r2 = 0
      else:
          r2 = init // bx
          init -= bx * r2
      res = 0
      for k in range(r0 + 1):
          for l in range(r1 + 1):
              for m in range(r2 + 1):
                  loss = k * gx + l * sx + m * bx
                  if loss > N:
                      continue
                  score = k * a + l * b + m * c
                  if score > res:
                      res = score
      N += res
  
  
  cal(ba, ca)
  cal(ab, cb)
  
  print(N)
  
problem_description: Statement
  
  The squirrel Chokudai has N acorns. One day, he decides to do some trades in
  multiple precious metal exchanges to make more acorns.
  
  His plan is as follows:
  
    1. Get out of the nest with N acorns in his hands.
    2. Go to Exchange A and do some trades.
    3. Go to Exchange B and do some trades.
    4. Go to Exchange A and do some trades.
    5. Go back to the nest.
  
  In Exchange X (X = A, B), he can perform the following operations any integer
  number of times (possibly zero) in any order:
  
    * Lose g_{X} acorns and gain 1 gram of gold.
    * Gain g_{X} acorns and lose 1 gram of gold.
    * Lose s_{X} acorns and gain 1 gram of silver.
    * Gain s_{X} acorns and lose 1 gram of silver.
    * Lose b_{X} acorns and gain 1 gram of bronze.
    * Gain b_{X} acorns and lose 1 gram of bronze.
  
  Naturally, he cannot perform an operation that would leave him with a negative
  amount of acorns, gold, silver, or bronze.
  
  What is the maximum number of acorns that he can bring to the nest? Note that
  gold, silver, or bronze brought to the nest would be worthless because he is
  just a squirrel.
samples: [{"input": "23\n    1 1 1\n    2 1 1", "output": "46\n    \n\nHe can bring 46 acorns to the nest, as follows:\n\n  * In Exchange A, trade 23 acorns for 23 grams of gold. {acorns, gold, silver, bronze}={ 0,23,0,0 }\n  * In Exchange B, trade 23 grams of gold for 46 acorns. {acorns, gold, silver, bronze}={ 46,0,0,0 }\n  * In Exchange A, trade nothing. {acorns, gold, silver, bronze}={ 46,0,0,0 }\n\nHe cannot have 47 or more acorns, so the answer is 46."}]