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<algorithm>
using namespace std;
long lcm(int a,int b) {
	long long gcd;
	long long c = max(a, b);
	long long d = min(a, b);
	while (true) {
		if (c % d == 0) {
			gcd = d;
			return a*b/gcd;
		}
		else {
			c -= d;
			if (c <= d) {
				swap(c, d);
			}
		}
	}
}
int main() {
	int n; cin >> n;
	long a, b; cin >> a >> b;
	a = lcm(a, b);
	for (int i = 0; i < n - 2; i++){
		cin >> b;
		a = lcm(a, b);
	}
	cout << a << endl;
}