from itertools import combinations
def solution(arr):
    def gcp(a,b):
        while b != 0:
            a, b = b, a % b
        return a

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

    # 첫번째와 두번째를 하고 나머지와 다시계산하는 식으로 접근한다!

    def lcm_recursive(numbers):
        if len(numbers) == 1:
            return numbers[0]
        else:
            first_res = lcm(numbers[0], numbers[1])
            return lcm_recursive([first_res] + numbers[2:])
    return lcm_recursive(arr)