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 <bits/stdc++.h>
#define INF 114514810
#define FOR(i, r, n) for(int i=(r); i<(n); i++) 
#define REP(i, n) FOR(i, (0), n)

using namespace std;

int a, b, x;

int gcd(int m, int n){
	if (!m || !n) return 0;
	while (m != n){
		if (m > n) m -= n;
		else n -= m;
	}
	return m;
}

int lcm(int cx, int cy)
{
	if (!cx || !cy) return 0;
	return cx*cy / gcd(cx, cy);
}

int main(){
	cin >> a;
	cin >> x;
	REP(i, a - 1)
	{
		cin >> b;
		x = lcm(x, b);
	}
	cout << x << endl;
}