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;
typedef long long LL;
const LL MOD = 1000000007LL;
LL gcd(LL a, LL b) {
	return b ? gcd(b, a%b) : a;
}
LL lcm(LL a, LL b) {
	return a / gcd(a, b)*b;
}
int main() {
	int n;
	cin >> n;
	LL ans = 1;
	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		ans = lcm(ans, a);
	}
	cout << ans << endl;
}
