output_description: Print the minimum possible value of B_1 + ... + B_N for B_1,...,B_N that
  satisfy the condition, modulo (10^9 +7).
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 ... A_N
attempt: n = int(input())
  lst = []
  s = 0
  ele = input()
  
  # for i in range(0, n):
  #     ele = (input())
  
  #     lst.append(ele)
  
  
  lst = list(ele.split(" "))
  
  for i in range(n):
      lst[i] = int(lst[i])
  
  
  def compute_lcm(x, y):
      # choose the greater number
      if x > y:
          greater = x
      else:
          greater = y
      while True:
          if (greater % x == 0) and (greater % y == 0):
              lcm = greater
              break
          greater += 1
      return lcm
  
  
  lccm = lst[0]
  for i in range(n):
      lccm = compute_lcm(lccm, lst[i])
  
  
  lsst = []
  s = 0
  for i in range(n):
      s = lccm / lst[i]
      lsst.append(s)
  
  s = 0
  for i in range(n):
      s = s + lsst[i]
  
  s = s % (10 ^ 9 + 7)
  
  print(int(s))
  
problem_description: Statement
  
  Given are N positive integers A_1,...,A_N.
  
  Consider positive integers B_1, ..., B_N that satisfy the following condition.
  
  Condition: For any i, j such that 1 \leq i < j \leq N, A_i B_i = A_j B_j
  holds.
  
  Find the minimum possible value of B_1 + ... + B_N for such B_1,...,B_N.
  
  Since the answer can be enormous, print the sum modulo (10^9 +7).
samples: [{"input": "3\n    2 3 4", "output": "13\n    \n\nLet B_1=6, B_2=4, and B_3=3, and the condition will be satisfied.\n\n* * *"}, {"input": "5\n    12 12 12 12 12", "output": "5\n    \n\nWe can let all B_i be 1.\n\n* * *"}, {"input": "3\n    1000000 999999 999998", "output": "996989508\n    \n\nPrint the sum modulo (10^9+7)."}]