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);
long long LCM(long long a,long long b);
int main(){
    int n;
    cin>>n;
    int a;
    long long ans=1;
    for(int i=0;i<n;i++){
        cin>>a;
        ans=LCM(ans,a);
    }
    cout<<ans<<"\n";
    return(0);
}
long long GCD(long long a,long long b){
    while(b!=0){
        long long r=a%b;
        a=b;
        b=r;
    }
    return(a);
}
long long LCM(long long a,long long b){
    return(a/GCD(a,b)*b);
}
