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

int gcd(int x, int y)
{
  if (y == 0){
    return (x);
  }
  else {
    return (gcd(y, x % y));
  }
}

int lcm(int x, int y)
{
  return (x / gcd(x, y) * y);
}

int main()
{
  int n;
  int a[10];

  scanf("%d", &n);
  for (int i = 0; i < n; i++){
    scanf("%d", &a[i]);
  }

  int ans = lcm(a[0], a[1]);

  for (int i = 2; i < n; i++){
    ans = lcm(ans, a[i]);
  }

  printf("%d\n", ans);

  return (0);
}