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 <bits/stdc++.h>

using namespace std;

int gcd(int a, int b) {
	while (b != 0) {
		int tmp = b;
		b = a%b;
		a = tmp;
	}
	return a;
}

int lcm(int a, int b) {
	return (a*b)/gcd(a, b);
}

int main(){
	int n; cin >> n;
	vector<int> nums(n);
	for (int i = 0; i < n; i++) cin >> nums[i]; 
	int res = 1;
	for (int i = 0; i < nums.size(); i++) {
		res = lcm(res, nums[i]);
	}
	cout << res << endl;

	return 0;
}