#from math import gcd

from fractions import gcd



n=int(eval(input()))



res=1

for _ in range(n):

    x=int(eval(input()))

    res=res//gcd(res,x)*x

print(res)

from functools import reduce



def gcd(a,b):

    while b:

        a,b=b,a%b

    return a



def lcm(a,b):

    return a//gcd(a,b)*b



n=int(eval(input()))

a=[int(eval(input())) for _ in range(n)]



print((reduce(lcm,a)))

# from math import gcd
from fractions import gcd

n = int(eval(input()))
res = 1
for _ in range(n):
    x = int(eval(input()))
    res = res // gcd(res, x) * x
print(res)

from functools import reduce


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


def lcm(a, b):
    return a // gcd(a, b) * b


n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
print((reduce(lcm, a)))

-# from math import gcd -from fractions import gcd +from functools import reduce + + +def gcd(a, b): +    while b: +        a, b = b, a % b +    return a + + +def lcm(a, b): +    return a // gcd(a, b) * b + -res = 1 -for _ in range(n): -    x = int(eval(input())) -    res = res // gcd(res, x) * x -print(res) +a = [int(eval(input())) for _ in range(n)] +print((reduce(lcm, a)))