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>
using namespace std;

/*
lcm(a, b) = ab / gcd(a, b)
*/

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

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

int main() {
	int n, i;
	cin >> n;
	long temp = 1;

	int a;

	for (i = 0; i < n; i++) {
		cin >> a;
		temp = lcm(temp, a);
	}

	cout << temp << endl;
	return 0;
}