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 <iostream>

using namespace std;

int gcd(int a, int b)
{
  if(a<b) swap(a,b);
  while(b>0)
  {
    int temp=b;
    b=a%b;
    a=temp;
  }
  return a;
}
int LCM(int a, int b)
{
  return (a/gcd(a,b))*b;
}
int main()
{
  int n; cin>>n;
  int ans; cin>>ans;
  for(int i=0;i<n-1;i++)
  {
    int in; cin>>in;
    ans=LCM(ans,in);
  }
  cout<<ans<<"\n";
}

