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<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
	int n,i,aa,a,b,x,y,ama;
	scanf("%d",&n);
	scanf("%d",&aa);
	for(i=1;i<n;i++)	{
		scanf("%d",&b);
		if(b>aa)	swap(aa,b);
		x=aa;	y=b;
		while(1)	{
			ama=x%y;
			if(ama==0)	break;
			x=y;	y=ama;
		}
		aa=aa/y*b;
	}
	printf("%d\n",aa);
	return 0;
}
