def gcd(a, b):

    while b:

        a, b = b, a % b

    return a



def lcm(a, b):

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



def solve():

    n = eval(input())

    nums = list(map(int, input().split()))

    

    ans = 1

    for n in nums:

        ans = lcm(n, ans)

        

    print(ans)



solve()
def gcd(a, b):

    while b:

        a, b = b, a % b

    return a



def lcm(a, b):

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



import functools



def solve():

    n = eval(input())

    nums = list(map(int, input().split()))

    print((functools.reduce(lcm, nums)))



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


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


def solve():
    n = eval(input())
    nums = list(map(int, input().split()))
    ans = 1
    for n in nums:
        ans = lcm(n, ans)
    print(ans)


solve()

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


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


import functools


def solve():
    n = eval(input())
    nums = list(map(int, input().split()))
    print((functools.reduce(lcm, nums)))


solve()

+import functools + + -    ans = 1 -    for n in nums: -        ans = lcm(n, ans) -    print(ans) +    print((functools.reduce(lcm, nums)))