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<algorithm>
#include<string>
using namespace std;
int main(){

	int n[15]={};

	int x;
	cin>>x;
	int max=0;
	for(int i=0;i<x;i++)
	{
		
		cin>>n[i];
		if(max<n[i])max=n[i];
	}

	int k=1;
	for(int i=2;i<=max;i++){bool f=false;
		for(int j=0;j<x;j++)
			{
				if(n[j]%i==0){
					f=true;n[j]/=i;
				}
		}
		if(f==true){k*=i;i=1;}
	}
	for(int i=0;i<x;i++)
		k*=n[i];

	cout<<k<<endl;
	return  0;

}

	