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>

using namespace std;

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

int main(){
  int n, lcm, a[12];
  cin >> n;
  for(int i=0;i<n;i++)cin >> a[i];
  lcm = a[0];
  for(int i=1;i<n;i++){
    long long lgcd = gcd(lcm, a[i]);
    lcm = lcm*a[i]/lgcd;
  }
  cout << lcm <<endl;
}
