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 * b / GCD(a, b);
}

int main()
{
	int N, num[128], lcm;
	cin >> N;
	for(int i = 0; i < N; ++i)
	{
		cin >> num[i];
		
		if(i == 0)
		{
			lcm = num[i];
		}
		else
		{
			lcm = LCM(lcm, num[i]);
		}
	}
	
	cout << lcm << endl;

    return 0;
}

