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 <vector>
#include <iostream>
#include <algorithm>

using namespace std;

long long GCD(long long a, long long b)
{
	if (max(a, b) % min(a, b) == 0) { return min(a, b); }

	return GCD(min(a, b), max(a, b) % min(a, b));
}

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

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

	vector<int> a(N);

	for (int i = 0; i < N; i++)
		cin >> a[i];

	for (int i = 1; i < N; i++)
		a[i] = LCM(a[i], a[i - 1]);

	cout << a[N - 1] << endl;

	return 0;
}