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>
using namespace std;

int gcd(int a, int b) { return b==0 ? a : gcd(b, a%b); }
int lcm(int a, int b) { return a/gcd(a, b)*b; }

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int n, ans;
	cin>>n;
	int a, b;
	cin>>a>>b;
	ans=lcm(a, b); n-=2;
	while(n--) {
		int x;
		cin>>x;
		ans=lcm(ans, x);
	}
	cout<<ans<<'\n';
	return 0;
}
