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 main()
{
	int n;
	int suu[20];
	int big;
	bool flg=true;
	int i;
	int x=1;
	
	cin >> n;
	
	for(i=0;i<n;i++)
	{
		cin >> suu[i];
	}
	
	big=suu[0];
	for(i=1;i<n;i++)
	{
		if(big<suu[i])
		{
			big=suu[i];
		}
	}
	
	while(flg)
	{
		flg=false;
		
		for( i=0 ; i<n ; i++ )
		{
			if( big*x % suu[i] != 0 )
			{
				flg=true;
			}
		}
		x++;
	}
	x--;
	cout << big*x << endl;
	return 0;
}