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 <cmath>
#include <vector>
#include <algorithm>
using namespace std;

long gcd(long m, long n) {
    if (m % n == 0) {
        return n;
    } else {
        return gcd(n, m % n);
    }
}

long lcm(long a, long b) {
    return a / gcd(a, b) * b;
}

int main() {
    long ans;
    int i, j;
    cin >> i >> i >> j;
    ans = lcm(i, j);
    while (cin >> j) {
        ans = lcm(ans, j);
    }
    cout << ans << endl;
}