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 <cmath>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;

int LCM(int m, int n) {
	int x = m*n;
	while (m%n != 0) {
		int temp = m%n;
		m = n; n = temp;
	}
	return x / n;
}

int main() {
	cin.tie(0); ios::sync_with_stdio(false);
	int n; cin >> n;
	vector<int> v(n);
	for (int i = 0;i < n; i++) {
		cin >> v[i];
	}
	sort(v.begin(), v.end(), greater<int>());

	int Ans = v[0];
	for (int i = 1; i < n; i++) {
		Ans = LCM(Ans, v[i]);
	}
	cout << Ans << endl;
}