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 <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
 
#define rep(i,n) for(int i = 0;i<n;i++)
const long long MOD = 1000000007;

int gcd(int a, int b){
  int tmp = 1;
  while(tmp != 0){
    tmp =  a%b;
    a = b;
    b = tmp;
  }
  return a;
}

int main(){
  int n;cin >> n;
  long long ans; cin >> ans;
  for(int i = 0; i<n-1; i++){
    int ai; cin >> ai;
    ans = (ans*ai)/gcd(ans,ai);
  }
  cout << ans << endl;
}
