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 GCD(int a, int b){
	int m = (a>b)?a:b;
	int n = (a>b)?b:a;
	int t;
	
	while(n!=0){
		t = m % n;
		m = n;
		n = t;
	}
	return m;
}
int LCM(int a, int b){
	return a*b/GCD(a,b);
}


int main() {
	int n;
	int a;
	int lcm=1;
	
	cin>>n;
	for(int i=0;i<n;++i){
		cin>>a;
		lcm = LCM(a,lcm);
	}
	cout << lcm << endl;
	
	return 0;
}