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 ll long long
#define INF 1000000005
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;++i)

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 11;

int a[MAX_N];
int n;

ll gcd(ll a,ll b)
{
	if(b==0){
		return a;
	}
	return gcd(b,a%b);
}

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

int main()
{
	scanf("%d",&n);
	rep(i,n){
		scanf("%d",&a[i]);
	}
	ll ans = 1;
	rep(i,n){
		ans = lcm(ans,a[i]);
	}
	printf("%lld\n",ans);
	return 0;
}