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>
typedef long long ll;
using namespace std;

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

int lcm(int a, int b) {
		return a / gcd(a, b) * b;
}

int main() {
		int n;
		int a[1000];
		cin >> n;
		int i = 0;
		while (cin >> a[i]) {
				i++;
		}

		ll temp = a[0];

		for (i = 1; i < n; i++) {
				temp = lcm(temp, a[i]);
		}
		
		cout << temp << endl;

		return 0;
}
		