from fractions import gcd

from functools import reduce



def lcm_base(x, y):

    return (x * y) // gcd(x, y)

def lcm_list(nums):

    return reduce(lcm_base, nums, 1)



def main():

    n = int(eval(input()))

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

    print((lcm_list(t)))



if __name__ == '__main__':

    main()

import sys

read = sys.stdin.read

from math import gcd

def main():

    n = int(eval(input()))

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

    if n == 1:

        print((t[0]))

        sys.exit()

    r = (t[0] * t[1]) // gcd(t[0], t[1])

    if n == 2:

        print(r)

        sys.exit()

    for i1 in range(2, n):

        r = (r * t[i1]) // gcd(r, t[i1])

    print(r)



if __name__ == '__main__':

    main()



from fractions import gcd
from functools import reduce


def lcm_base(x, y):
    return (x * y) // gcd(x, y)


def lcm_list(nums):
    return reduce(lcm_base, nums, 1)


def main():
    n = int(eval(input()))
    t = [int(eval(input())) for _ in range(n)]
    print((lcm_list(t)))


if __name__ == "__main__":
    main()

import sys

read = sys.stdin.read
from math import gcd


def main():
    n = int(eval(input()))
    t = [int(eval(input())) for _ in range(n)]
    if n == 1:
        print((t[0]))
        sys.exit()
    r = (t[0] * t[1]) // gcd(t[0], t[1])
    if n == 2:
        print(r)
        sys.exit()
    for i1 in range(2, n):
        r = (r * t[i1]) // gcd(r, t[i1])
    print(r)


if __name__ == "__main__":
    main()

-from fractions import gcd -from functools import reduce +import sys - -def lcm_base(x, y): -    return (x * y) // gcd(x, y) - - -def lcm_list(nums): -    return reduce(lcm_base, nums, 1) +read = sys.stdin.read +from math import gcd -    print((lcm_list(t))) +    if n == 1: +        print((t[0])) +        sys.exit() +    r = (t[0] * t[1]) // gcd(t[0], t[1]) +    if n == 2: +        print(r) +        sys.exit() +    for i1 in range(2, n): +        r = (r * t[i1]) // gcd(r, t[i1]) +    print(r)