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;
long long qq(long long x,long long y){
    if(y==0){
        return x;
    }
    else{
        return qq(y,x%y);
    }
}
int main(){
    int n;
    cin>>n;
    long long ans,d;
    cin>>ans;
    for(int i=1;i<n;i++){
        cin>>d;
        ans=ans*d/qq(ans,d);
    }
    cout<<ans<<endl;
    return 0;
}
