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;

long long GCD(long long A, long long B) {
	if (B == 0) return A;
	return GCD(B, A % B);
}

long long LCM(long long A, long long B) {
	return A * (B / GCD(A, B));
}

int main() {
	long long N, A, L = 1;
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> A;
		L = LCM(L, A);
	}
	cout << L << endl;
}
