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

typedef long long ll;

ll euc(ll a, ll b){
	  return (a%b==0) ? b : euc(b,a%b);
}

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

int main (){

	  ll n;
	  cin >> n;
	  ll a[n+1];
	  for(int i=1; i<=n; i++) cin >> a[i];

	  ll ans = 1;
	  for(int i=1; i<=n; i++)
			ans = lcm(ans,a[i]);
	  
	  cout << ans << endl;
			
	  
	  
	  
	  
	  
}