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>
#include <iomanip>
#include<vector>
#include<string>
#include<string.h>
#include<math.h>
#include<utility>
#include<algorithm>
#include<functional>
using namespace std;




int min(int a,int b)
{
	int sa=a,sb=b;
if(a<b)
	{
		swap(a,b);
}
while(b)
{
a=a%b;
swap(a,b);
}

return sa*sb/a;
}

int n;
int a=1,b=1;

int main()
{
	cin>>n;
	
	for(int i=0;i<n;i++)
	{
	cin>>b;
	
	a=min(a,b);

	}

	cout<<a<<endl;

	return 0;
}