from fractions import gcd

n=int(eval(input()))

s=1

for i in range(n):

    t=int(eval(input()))

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

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

    if b==0:

        return abs(a)

    return gcd(b,a%b)



def lcm(a,b):

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



#n,m=map(int,input().split())

#print(gcd(n,m))

n=int(eval(input()))

a=[]

for i in range(n):

    a.append(int(eval(input())))

#a=list(map(int,input().split()))

m=a[0]

for i in range(1,len(a)):

    m=lcm(m,a[i])



print(m)
from fractions import gcd

n = int(eval(input()))
s = 1
for i in range(n):
    t = int(eval(input()))
    s = s * t // gcd(s, t)
print(s)

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


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


# n,m=map(int,input().split())
# print(gcd(n,m))
n = int(eval(input()))
a = []
for i in range(n):
    a.append(int(eval(input())))
# a=list(map(int,input().split()))
m = a[0]
for i in range(1, len(a)):
    m = lcm(m, a[i])
print(m)

-from fractions import gcd +def gcd(a, b): +    if b == 0: +        return abs(a) +    return gcd(b, a % b) + +def lcm(a, b): +    return (a * b) // gcd(a, b) + + +# n,m=map(int,input().split()) +# print(gcd(n,m)) -s = 1 +a = [] -    t = int(eval(input())) -    s = s * t // gcd(s, t) -print(s) +    a.append(int(eval(input()))) +# a=list(map(int,input().split())) +m = a[0] +for i in range(1, len(a)): +    m = lcm(m, a[i]) +print(m)