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;

long long gcd(long long a, long long b) {
    long long int mod = a % b;
    if (mod == 0) {
        return b;
    } else {
        return gcd(b, mod);
    }
}

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

int main() {
    int n;
    cin >> n;

    long long ans = 1;
    for (int i = 0; i < n; ++i) {
        long long t;
        cin >> t;
        ans = lcm(ans, t);
    }

    cout << ans << endl;
    return 0;
}
