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 <stdio.h>
#include <vector>
using namespace std;
typedef unsigned long long ul;

ul gcd(ul x, ul y){
	if(y == 0)
		return x;
	else
		return gcd(y, x%y);
}

int main(){
	int n;
	vector<ul> a;

	cin>>n;
	for(int i=0;i<n;i++){
		ul temp;
		cin>>temp;
		a.push_back(temp);
	}

	for(int i=0;i<n-1;i++){
		a[i+1] = a[i] * a[i+1] / gcd(a[i], a[i+1]);
	}

	cout<<a[n-1]<<endl;
	return 0;
}