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>
#define MAX 100

using namespace std;

int gcd(int, int);
int lcm(int, int);

int main(void){

	int n, ans;
	int a[MAX];

	cin >> n;
	for(int i = 0 ; i < n ; ++i){
		cin >> a[i];
	}

	ans = 1;
	for(int i = 0 ; i < n ; ++i){
		ans = lcm(ans, a[i]);
	}
	cout << ans << endl;
	
	return 0; 
}

int lcm(int t0, int t1){
	return t0 * t1 / gcd(t0, t1);
}

int gcd(int t0, int t1){

	if(t0 < t1){
		swap(t0, t1);
	}

	while(t1 > 0){
		int temp = t0 % t1;
		t0 = t1;
		t1 = temp;
	}
	return t0;
}