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;
int min_mul(int m, int n){
    if (n == 0) return m;
    else
        min_mul(n, m % n);
}
 
int max_mul(int m, int n){
    return m*n/min_mul(m,n);
}
 
 
 
 
int main(){
    int n;
    cin>>n;
    int* data = new int(n);
    for(int i=0;i<n;i++)
        cin>>data[i];
    int ans = data[0];
    for(int j=1;j<n;j++){
        ans = max_mul(ans,data[j]);
    }
    cout<<ans<<endl;
    return 0;
}