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

inline long long gcd(const long long &a, const long long &b) {
	if (b == 0)return a;
	return gcd(b, a%b);
}

inline long long lcm(const long long &a, const long long &b) {
	return a*b / gcd(a, b);
}

int main() {
	cin.tie(0);
	ios::ios_base::sync_with_stdio(false);
	int n;  cin >> n;
	vector<long long> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
	}
	for (int i = 0; i < n - 1; ++i) {
		a[i + 1] = lcm(a[i], a[i + 1]);
	}
	cout << a[n - 1] << endl;
}