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;

int gcd(int a, int b) {
    if (a < b) swap(a, b);
    if (a % b == 0) return b;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    int g = gcd(a, b);
    return a / g * b;
}

int main() {
    int N; cin >> N;
    int A = 1;
    for (int i = 0; i < N; i++) {
        int x; cin >> x;
        A = lcm(A, x);
    }
    cout << A << endl;
    return 0;
}