def gcd(a, b):

	"""Compute the greatest common divisor of a and b"""

	while b > 0:

		a, b = b, a % b

	return a



def lcm(a, b):

	"""Compute the lowest common multiple of a and b"""

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



def resolve():

	n = int(eval(input()))

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

	ans = t[0]

	for i in t[1:]:

		ans = lcm(ans, i)

	print(ans)

resolve()
def resolve():

	n = int(eval(input()))

	ans = int(eval(input()))

	for i in range(n-1):

		v = int(eval(input()))

		a = ans

		b = v

		r = a%b

		while r:

			a = b

			b = r

			r = a % b

		ans = ans * v // b

	print(ans)

resolve()
def gcd(a, b):
    """Compute the greatest common divisor of a and b"""
    while b > 0:
        a, b = b, a % b
    return a


def lcm(a, b):
    """Compute the lowest common multiple of a and b"""
    return a * b // gcd(a, b)


def resolve():
    n = int(eval(input()))
    t = [int(eval(input())) for _ in range(n)]
    ans = t[0]
    for i in t[1:]:
        ans = lcm(ans, i)
    print(ans)


resolve()

def resolve():
    n = int(eval(input()))
    ans = int(eval(input()))
    for i in range(n - 1):
        v = int(eval(input()))
        a = ans
        b = v
        r = a % b
        while r:
            a = b
            b = r
            r = a % b
        ans = ans * v // b
    print(ans)


resolve()

-def gcd(a, b): -    """Compute the greatest common divisor of a and b""" -    while b > 0: -        a, b = b, a % b -    return a - - -def lcm(a, b): -    """Compute the lowest common multiple of a and b""" -    return a * b // gcd(a, b) - - -    t = [int(eval(input())) for _ in range(n)] -    ans = t[0] -    for i in t[1:]: -        ans = lcm(ans, i) +    ans = int(eval(input())) +    for i in range(n - 1): +        v = int(eval(input())) +        a = ans +        b = v +        r = a % b +        while r: +            a = b +            b = r +            r = a % b +        ans = ans * v // b