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 <vector>
using namespace std;
int gcd(int x,int y){
	if (!y) return x;
	return gcd(y,x%y); 
}
int lcm(int x,int y){
	return x*(y/gcd(x,y));
}
int main(){
	vector<int> v;
	int n,x;
	cin >> n;
	for (int i=1;i<=n;++i) cin >> x, v.push_back(x);
	for (int i=0;i<n;++i) {
		v[i+1]=lcm(v[i],v[i+1]); 
	}
	cout << v[n-1] << endl;
	return 0;
}