n=int(eval(input()))

t=1

import fractions

for i in range(n):

  j=int(eval(input()))

  t=t*j//fractions.gcd(t,j)

print(t)
def lcm(n,m):

  while m!=0:

    n,m=m,n%m

  return n

def gcd(n,m):

  return n*m//lcm(n,m)

n=int(eval(input()))

c=int(eval(input()))

for i in range(n-1):

  c1=int(eval(input()))

  c=gcd(c,c1)

print(c)
n = int(eval(input()))
t = 1
import fractions

for i in range(n):
    j = int(eval(input()))
    t = t * j // fractions.gcd(t, j)
print(t)

def lcm(n, m):
    while m != 0:
        n, m = m, n % m
    return n


def gcd(n, m):
    return n * m // lcm(n, m)


n = int(eval(input()))
c = int(eval(input()))
for i in range(n - 1):
    c1 = int(eval(input()))
    c = gcd(c, c1)
print(c)

+def lcm(n, m): +    while m != 0: +        n, m = m, n % m +    return n + + +def gcd(n, m): +    return n * m // lcm(n, m) + + -t = 1 -import fractions - -for i in range(n): -    j = int(eval(input())) -    t = t * j // fractions.gcd(t, j) -print(t) +c = int(eval(input())) +for i in range(n - 1): +    c1 = int(eval(input())) +    c = gcd(c, c1) +print(c)