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;
int num[20];

int gcd(int a, int b) {
	return b == 0 ? a : gcd(b, a % b);
}

int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> num[i];
	int ans = num[1];
	for (int i = 2; i <= n; i++) {
		ans = ans * num[i] / gcd(ans, num[i]);
	}
	cout << ans<<endl;
}
