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;


/*
    LCM : Least Common multiple
*/


template<typename T> T LCM(T a, T b) {
    if (a > b) swap(a, b);
    T r = a%b, c = a, d = b;
    while (r != 0) {a = b; b = r; r = a%b; }
    return c/b*d;
}


int main() {
    int N, ans = 1;
    cin >> N;
    
    for (int i = 0; i < N; i++) {
        int a;
        cin >> a;
        ans = LCM(ans, a);
    }
    
    cout << ans << endl;
    return 0;
}
