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){
  int r = 0;
  while(true){
    /*a = abs(a);
    b = abs(b);*/
    r = a % b;
    a = b;
    b = r;
    if(r == 0){break;}
  }
  return a;
}
long long lcm(long long a, long long b){
  int L = 0;
  int G = gcd(a,b);
  L = a / G * b;
  return L;
}
int main(){
  long long N, Input;
  long long anslcm = 1;
  cin >> N;
  for(int i = 0; i < N; i++){
    cin >> Input;
    anslcm = lcm(anslcm,Input);
  }
  cout << anslcm << endl;
  return 0;
}
