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>
#include <cmath>
using namespace std;
int gcd(int a, int b) {
  if (a == 0 || b == 0) return 0;
  while (a != b)
    if (a > b) a -= b;
    else b -= a;
  return a;
}
int main() {
  int n, a, b = 1;
  cin >> n;
  while (n--) {
    cin >> a;
    b = (a * b) / gcd(a, b);
  }
  cout << b << endl;
}