output_description: For each testcase, print the answer on Standard Output followed by a newline.
  
  * * *
input_description: The input is given from Standard Input. The first line of the input is
  
      
      
      T
      
  
  Then, T lines follow describing the T testcases. Each of the T lines has the
  format
  
      
      
      N A B C D
attempt: def even(n):
      c1 = five(n)
      c2 = three(n)
      c3 = two(n)
      return c1 * c + c2 * b + c3 * a + d
  
  
  def odd(n):
      x = n - 1
      c1 = five(x)
      c2 = three(x)
      c3 = two(x)
      return c1 * c + c2 * b + c3 * a + 2 * d
  
  
  def five(n):
  
      count1 = 0
      while n % 5 != 0:
          n = n / 5
          count1 += 1
      return count1
  
  
  def two(n):
      count2 = 0
      while n % 2 != 0:
          n = n / 2
          count2 += 1
      return count2
  
  
  def three(n):
      count3 = 0
      while n % 3 != 0:
          n = n / 3
          count3 += 1
      return count3
  
  
  t = int(input())
  for i in range(t - 1):
      n, a, b, c, d = map(int, input().split())
  if n % 2 == 0:
      even(n)
  else:
      odd(n)
  
problem_description: Statement
  
  You start with the number 0 and you want to reach the number N.
  
  You can change the number, paying a certain amount of coins, with the
  following operations:
  
    * Multiply the number by 2, paying A coins.
    * Multiply the number by 3, paying B coins.
    * Multiply the number by 5, paying C coins.
    * Increase or decrease the number by 1, paying D coins.
  
  You can perform these operations in arbitrary order and an arbitrary number of
  times.
  
  What is the minimum number of coins you need to reach N?
  
  **You have to solve T testcases.**
samples: [{"input": "5\n    11 1 2 4 8\n    11 1 2 2 8\n    32 10 8 5 4\n    29384293847243 454353412 332423423 934923490 1\n    900000000000000000 332423423 454353412 934923490 987654321", "output": "20\n    19\n    26\n    3821859835\n    23441258666\n    \n\nFor the first testcase, a sequence of moves that achieves the minimum cost of\n20 is:\n\n  * Initially x = 0.\n  * Pay 8 to increase by 1 (x = 1).\n  * Pay 1 to multiply by 2 (x = 2).\n  * Pay 1 to multiply by 2 (x = 4).\n  * Pay 2 to multiply by 3 (x = 12).\n  * Pay 8 to decrease by 1 (x = 11).\n\nFor the second testcase, a sequence of moves that achieves the minimum cost of\n19 is:\n\n  * Initially x = 0.\n  * Pay 8 to increase by 1 (x = 1).\n  * Pay 1 to multiply by 2 (x = 2).\n  * Pay 2 to multiply by 5 (x = 10).\n  * Pay 8 to increase by 1 (x = 11)."}]