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>

int gcd(const int &a, const int &b) {
	if (a % b == 0) {
		return b;
	}
	else {
		return gcd(b, a % b);
	}
}
int lcd(const int &a, const int &b) {
	return a / gcd(a, b) * b;
}

int main() {
	int n;
	std::cin >> n;
	int largest = 1;
	for (auto i = 0; i < n; ++i) {
		int a;
		std::cin >> a;
		largest = lcd(largest, a);
	}
	std::cout << largest << std::endl;
	return 0;
}