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
// Author: Shusuke Ueda
// AOJ NTL_1_C (Least Common Multiple)

#include <iostream>

namespace nt {
    template <typename T>
    T gcd(T m, T n) {
        return n == 0? m: gcd(n, m % n);
    }

    template <typename T>
    T lcm(T m, T n) {
        return m / gcd(m, n) * n;
    }
}

int main() {
    int n;
    std::cin >> n;
    int ans = 1;
    for (int i = 0; i < n; i++) {
        int a;
        std::cin >> a;
        ans = nt::lcm(ans, a);
    }

    std::cout << ans << std::endl;

    return 0;
}
