output_description: Print the number of seconds after which the hand of every clock point directly
  upward again.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      T_1
      :  
      T_N
attempt: import sys
  import math
  
  sys.setrecursionlimit(10**8)
  ini = lambda: int(sys.stdin.readline())
  inm = lambda: map(int, sys.stdin.readline().split())
  inl = lambda: list(inm())
  ins = lambda: sys.stdin.readline().rstrip()
  debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
  
  n = ini()
  T = [ini() for _ in range(n)]
  
  
  def solve():
      a = T[0]
      for t in T[1:]:
          g = math.gcd(a, t)
          a = g * (a // g) * (t // g)
      return a
  
  
  print(solve())
  
problem_description: Statement
  
  We have N clocks. The hand of the i-th clock (1≤i≤N) rotates through 360° in
  exactly T_i seconds.  
  Initially, the hand of every clock stands still, pointing directly upward.  
  Now, Dolphin starts all the clocks simultaneously.  
  In how many seconds will the hand of every clock point directly upward again?
samples: [{"input": "2\n    2\n    3", "output": "6\n    \n\nWe have two clocks. The time when the hand of each clock points upward is as\nfollows:\n\n  * Clock 1: 2, 4, 6, ... seconds after the beginning\n  * Clock 2: 3, 6, 9, ... seconds after the beginning\n\nTherefore, it takes 6 seconds until the hands of both clocks point directly\nupward.\n\n* * *"}, {"input": "5\n    2\n    5\n    10\n    1000000000000000000\n    1000000000000000000", "output": "1000000000000000000"}]