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>
#include <vector>

using namespace std;

int gcd(int a, int b) {
	int r;

	while(b > 0) {
		r = a % b;
		a = b;
		b = r;
	}

	return a;
}

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

int main() {
	int n;
	vector<int> a;

	cin >> n;

	a.resize(n);

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

	for(int i = 1;i < n;i++) {
		a[i] = lcm(a[i - 1], a[i]);
	}

	cout << a[n - 1] << endl;

	return 0;
}