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 i64 = int_fast64_t;

i64 gcd(i64 a,i64 b){
    while(b){
        a%=b;
        std::swap(a,b);
    }
    return a;
}
i64 lcm(i64 a,i64 b){
    return a/gcd(a,b)*b;
}

int main(){
    int n;
    std::cin>>n;
    i64 ans = 1;
    for(int i=0;i<n;++i){
        i64 a;
        std::cin>>a;
        ans = lcm(ans,a);
    }
    std::cout<<ans<<std::endl;
}
