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

Constraints

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

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.

Examples

Input

3
3 4 6


Output

12


Input

4
1 2 3 5


Output

30
#include <iostream>

uint32_t gcd(uint32_t a, uint32_t b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}

int main() {
  uint32_t n = 0;
  std::cin >> n;

  uint32_t a = 0, b = 0;
  std::cin >> a;
  for (size_t i = 0; i < n - 1; i++) {
    std::cin >> b;
    if (a < b)
      a = (a * b) / gcd(a, b);
    else
      a = (a * b) / gcd(b, a);
  }

  std::cout << a << std::endl;

  return 0;
}
