import fractions

n=int(eval(input()))

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

t.sort()

check=t[0]

if n==1:

    print(check)

else:

    for i in range(n-1):

        f1=fractions.gcd(check,t[i+1])

        f2=check*t[i+1]//f1

        check=f2

    print(f2)
n=int(eval(input()))

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



def gcd(a,b):

	while b:

		a,b=b,a%b

	return a



	

if n==1:

	print((t[0]))

	exit()



check=gcd(t[0],t[1])

ans=t[0]*t[1]//check

for i in range(2,n):

	check=gcd(ans,t[i])

	ans=ans*t[i]//check

print(ans)
import fractions

n = int(eval(input()))
t = [int(eval(input())) for i in range(n)]
t.sort()
check = t[0]
if n == 1:
    print(check)
else:
    for i in range(n - 1):
        f1 = fractions.gcd(check, t[i + 1])
        f2 = check * t[i + 1] // f1
        check = f2
    print(f2)

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


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


if n == 1:
    print((t[0]))
    exit()
check = gcd(t[0], t[1])
ans = t[0] * t[1] // check
for i in range(2, n):
    check = gcd(ans, t[i])
    ans = ans * t[i] // check
print(ans)

-import fractions - -t.sort() -check = t[0] + + +def gcd(a, b): +    while b: +        a, b = b, a % b +    return a + + -    print(check) -else: -    for i in range(n - 1): -        f1 = fractions.gcd(check, t[i + 1]) -        f2 = check * t[i + 1] // f1 -        check = f2 -    print(f2) +    print((t[0])) +    exit() +check = gcd(t[0], t[1]) +ans = t[0] * t[1] // check +for i in range(2, n): +    check = gcd(ans, t[i]) +    ans = ans * t[i] // check +print(ans)