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>

long long lcm(long long, long long);

int main()
{
	int n;
	long long ans{1};
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		long long a;
		scanf("%lld", &a);
		ans = lcm(ans, a);
	}
	printf("%lld\n", ans);

	return 0;
}

long long lcm(long long a, long long b)
{
	long long gcd{a}, tmp{b};
	while (tmp)
	{
		gcd %= tmp;
		std::swap(tmp, gcd);
	}
	return a / gcd * b;
}
