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;
typedef unsigned long long ullong;

ullong GCD(ullong a, ullong b){
  if(b == 0)
    return a;
  return GCD(b, a % b);
}

ullong LCM(ullong a, ullong b){
  if(a > b)
    return a * b / GCD(a, b);
  else
    return a * b / GCD(b, a);
}

int main(){
  int n;
  cin >> n;
  ullong result, a, b;
  cin >> a >> b;
  result = LCM(a, b);
  for(int i = 0; i < n - 2; i++){
    cin >> a;
    result = LCM(result, a);
  }
  cout << result << endl;
}