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 m,int n)
{
	if(n==0) return m;
	return gcd(n,m%n);
}

int lcm(int m,int n)
{
	return m*n/gcd(m,n);
}

int main()
{
	int n,A[10];
	
	cin >> n;
	for(int i=0;i<=n-1;i++) cin >> A[i];
	int ans=A[0];
	for(int i=1;i<=n-1;i++) ans=lcm(ans,A[i]);
	cout << ans << endl;
	return 0;
}