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 <algorithm>
#include <vector>
#include <cmath>
#include <map>

using namespace std;

int gcd ( int a, int b )
{
	return (b ? gcd(b, a % b) : a);
}

int lcm ( int a, int b )
{
	return a * b / gcd(a, b);
}

int lcm3 ( vector<int> v )
{
	for ( int i = 1; i < v.size(); ++i ) {
		v[0] = lcm( v[0], v[i] );
	}
	return v[0];
}

int main() {
	int n;
	while ( cin >> n ) {
		vector<int> v( n );
		for ( int i = 0; i < n; ++i ) {
			cin >> v[i];
		}
		cout << lcm3( v ) << endl;
	}
	return 0;
}