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 <iomanip>
#include <vector>
#include <complex>
#include <cmath>
#define shosu(x) fixed<<setprecision(x)
using namespace std;
int gcd(int a,int b){
	if(b==0) return a;
	return gcd(b,a%b);
}

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

int main(){
	int num,ans;
	int tmp[15];
	cin>>num;
	for(int i=0;i<num;i++){
		cin>>tmp[i];
	}
	ans=lcm(tmp[0],tmp[1]);
	for(int j=2;j<num;j++){
		ans=lcm(ans,tmp[j]);
	}
	cout<<ans<<endl;
}