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>

long euclid_algo(long x, long y){
	if(x % y == 0){
		return y;
	}else{
		return euclid_algo(y, x%y);
	}
}

int main(){
	int n;
	std::cin >> n;
	int num[n];
	int ans=0;
	int gcd = 1;
	for(int i = 0; i < n; i++){
	std::cin >> num[i];
	}
	ans = num[0];
	for(int i = 1; i < n; i++){
		gcd = euclid_algo(ans, num[i]);
		ans = ans * num[i] / gcd;
	}
	std::cout << ans <<std::endl;
	return 0;
}