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>
#include <vector>
#include <numeric>

using namespace std;

#define all(c) (c).begin(), (c).end()

template<typename T> T gcd(T a, T b){return b? gcd(b, a % b): a;}
template<typename T> T lcm(T a, T b){return a / gcd(a, b) * b;}

int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    for(auto& e: a)cin >> e;
    cout << accumulate(all(a), a[0], lcm<int>) << '\n';
    return 0;
}