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 <cstdio>
#include <string>
#include <cmath>
#include <vector>
#include <algorithm>
#include <map>
#include <utility>

using namespace std;

int gcd(int a, int b){
	if(a < b) swap(a,b);
	if(a == 0 || b == 0) return max(a,b);
	else return gcd(b, a % b);
}

int main(){
	int n, tmp;
	vector<int> v;
	cin >> n;
	for(int i = 0; i < n; i++){
		cin >> tmp;
		v.push_back(tmp);
	}
	int ans = v[0];
	for(int i = 1; i < n; i++)
		ans = ans * v[i] / gcd(ans, v[i]);
	cout << ans << endl;
}