def gcd(a,b):

    if b==0:

        return a

    return gcd(b,a%b)





n = int(eval(input()))

ans = 1

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



for i in l:

    ans = ans*i//gcd(ans,i)

print(ans)
def gcd(a,b):

    if b==0:

        return a

    else:

        return gcd(b,a%b)



n = int(eval(input()))

ans = 0

for i in range(n):

    t = int(eval(input()))

    if ans==0:

        ans=t

    else:

        ans = (ans*t)//gcd(ans,t)

print(ans)
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


n = int(eval(input()))
ans = 1
l = [int(eval(input())) for i in range(n)]
for i in l:
    ans = ans * i // gcd(ans, i)
print(ans)

def gcd(a, b):
    if b == 0:
        return a
    else:
        return gcd(b, a % b)


n = int(eval(input()))
ans = 0
for i in range(n):
    t = int(eval(input()))
    if ans == 0:
        ans = t
    else:
        ans = (ans * t) // gcd(ans, t)
print(ans)

-    return gcd(b, a % b) +    else: +        return gcd(b, a % b) -ans = 1 -l = [int(eval(input())) for i in range(n)] -for i in l: -    ans = ans * i // gcd(ans, i) +ans = 0 +for i in range(n): +    t = int(eval(input())) +    if ans == 0: +        ans = t +    else: +        ans = (ans * t) // gcd(ans, t)