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<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<queue>
#include<list>
#include<set>
#include<cmath>

#define REP(i,n) for(int (i) = 0;(i) < (n);(i)++)
using namespace std;

int GCD(int n,int m){
	if(m==0) return n;
	return GCD(m,n%m);
}

int LCM(int n,int m){
	return n*m/GCD(n,m);
}

int main(){
	int n,m,k;
	cin >> n >> m;
	REP(i,n-1){
		cin >> k;
		m = LCM(m,k);
	}
	cout << m << endl;
}