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<cstdio>
#include<algorithm>
using namespace std;

int n, input_data;

int GCD(int a, int b){
	if(a < b) swap(a, b);
	if(b == 0) return a;
	return GCD(b, a % b);
}

int main(void){
	scanf("%d", &n);
	int least_common_multiple = 1;
	for(int i = 1; i <= n; i++){
		scanf("%d", &input_data);
		least_common_multiple = least_common_multiple * input_data / GCD(least_common_multiple, input_data);
	}
	printf("%d\n", least_common_multiple);
	return 0;
}