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 (b == 0)
        return a;

    return GCD(b, a % b);
}

int LCM(int a, int b)
{
    return a  / GCD(a, b) * b;
}

int main()
{
	int n;

	cin >> n;

	int v1, v2, lcm;
	cin >> v1;
	cin >> v2;
	lcm = LCM(v1, v2);

	for (int i = 2; i < n; i++) {
		cin >> v1;
		lcm = LCM(lcm, v1);
	}
	cout << lcm << endl;
	return 0;
}

