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>
#define REP(i,n) for (int i=0;i<(n);i++)

using namespace std;

int gcd (int a, int b) {
  int tmp,r;
  if ( a < b) {
    tmp = a;
    a = b;
    b = tmp;
  }

  while((r = a % b) != 0) {
    a = b;
    b = r;
  }
  return b;
}

int lcm(int a, int b) {
    return (a * b) / gcd(a, b);
}

int main()
{
    int n,a,b;
    cin >> n >> a;

    REP(i, n-1) {
      cin >> b;
      a = lcm(a, b);
    }

    cout << a << endl;
    return 0;
}