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;

template <class T>
T gcd(T a, T b)
{
	return b ? gcd(b, a % b) : a;
}

signed main(void)
{
	int n; cin >> n;
	long long ans = 1;
	for (int i = 1; i <= n; ++i)
	{
		long long num; cin >> num;
		ans = ans * num / gcd(ans, num);
	}
	cout << ans << endl;
}