from fractions import gcd

n=int(eval(input()))

l=[int(eval(input())) for i in range(n)]

if n==1:

    print((l[0]))

elif n==2:

    x=gcd(l[0],l[1])

    print((l[0]*l[1]//x))

else:

    g=gcd(l[0],l[1])

    lcm=l[0]*l[1]//g

    for i in range(2,n):

        g=gcd(lcm,l[i])

        lcm=lcm*l[i]//g

    print(lcm)
from fractions import gcd

from functools import reduce

n=int(eval(input()))

l=[int(eval(input())) for i in range(n)]



def lcm(x,y):

    return (x*y)//gcd(x,y)

def lcm_list(numbers):

    return reduce(lcm,numbers,1)

if n==1:

    print((l[0]))

else:

    print((lcm_list(l)))
from fractions import gcd

n = int(eval(input()))
l = [int(eval(input())) for i in range(n)]
if n == 1:
    print((l[0]))
elif n == 2:
    x = gcd(l[0], l[1])
    print((l[0] * l[1] // x))
else:
    g = gcd(l[0], l[1])
    lcm = l[0] * l[1] // g
    for i in range(2, n):
        g = gcd(lcm, l[i])
        lcm = lcm * l[i] // g
    print(lcm)

from fractions import gcd
from functools import reduce

n = int(eval(input()))
l = [int(eval(input())) for i in range(n)]


def lcm(x, y):
    return (x * y) // gcd(x, y)


def lcm_list(numbers):
    return reduce(lcm, numbers, 1)


if n == 1:
    print((l[0]))
else:
    print((lcm_list(l)))

+from functools import reduce + + +def lcm(x, y): +    return (x * y) // gcd(x, y) + + +def lcm_list(numbers): +    return reduce(lcm, numbers, 1) + + -elif n == 2: -    x = gcd(l[0], l[1]) -    print((l[0] * l[1] // x)) -    g = gcd(l[0], l[1]) -    lcm = l[0] * l[1] // g -    for i in range(2, n): -        g = gcd(lcm, l[i]) -        lcm = lcm * l[i] // g -    print(lcm) +    print((lcm_list(l)))