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;

u_int lcm(const u_int* a, u_int n)
{
	u_int max = a[0];
	for (u_int i = 1; i < n; i++)
		if (a[i] > max)
			max = a[i];

	u_int res = max;
	while (1) {
		u_int i = 0;
		for (; i < n; i++)
			if (res % a[i])
				break;

		if (i == n)
			return res;
		else
			res += max;
	}
}

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

	u_int a[n];
	for (u_int i = 0; i < n; i++)
		cin >> a[i];

	cout << lcm(a, n) << endl;
	
    return 0;
}