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 <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
  int n;
  int a[1000];
  scanf("%d\n",&n);
  for(int i=0;i<n;i++)scanf("%d",&a[i]);
  sort(a,a+n);
  int v=a[n-1],x=0;
  bool f=0;
  while(!f){
    f=1;
    x+=v;
    for(int i=0;i<n-1;i++){
      if(x%a[i]!=0) f=0;
    }
  }
  printf("%d\n",x);
  return 0;
}