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 <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
int gcd(int x,int y){
	return y==0?x:gcd(y,x%y);
}
int main(){
	int n;scanf("%d",&n);
	long long ans=1;
	for(int i=1;i<=n;i++){
		int x;scanf("%d",&x);ans=ans*x/gcd(ans,x);
	}
	printf("%lld\n",ans);
	return 0;
}

