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<cstdio>
using namespace std;
int gcd(int x,int y){
	if(y==0)return x;
	return gcd(y,x%y);
}
int lcm(int x,int y){
	return x*y/gcd(x,y);
}
int main()
{
	int N;
	int ans;
	int A[10];
	scanf("%d",&N);
	for(int i=0;i<N;i++)scanf("%d",&A[i]);
	ans=A[0];
	for(int i=1;i<N;i++){
		ans=lcm(ans,A[i]);
	}
	printf("%d\n",ans);
	return 0;
}