Time Limit : sec, Memory Limit : KB
English / Japanese  

Least Common Multiple


Find the least common multiple (LCM) of given n integers.

Input

n
a1 a2 ... an

n is given in the first line. Then, n integers are given in the second line.

Output

Print the least common multiple of the given integers in a line.

Constraints

  • 2 ≤ n ≤ 10
  • 1 ≤ ai ≤ 1000
  • Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1

Sample Input 1

3
3 4 6

Sample Output 1

12

Sample Input 2

4
1 2 3 5

Sample Output 2

30