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<stdio.h>
#include<iostream>
#include<string>
#include<math.h>

using namespace std;

int LCM(int a, int b) {
	int i = 2;
	int gcd = 1;
	
	while (i <= a && i <= b) {
		if (a % i == 0 && b % i == 0) {
			gcd *= i;
			a /= i;
			b /= i;
		}
		else i++;
	}
	return a * b * gcd;

}

int main(){

	int size;
	cin >> size;
	int a;

	int result = 1;
	for (int i = 0; i < size; i++) {
		cin >> a;
		result = LCM(result, a);
	}

	cout << result << endl;
	//system("pause");
	return 0;
	
}


