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;
#include<cstdio>

int gcd(int a, int b)  // positive number only.
{
    int r = a % b;
    if(r == 0) return b;
    return gcd(b, r);
}

int main()
{
    int i, n, *A;
    int lcm, g;
    scanf("%d", &n);
    A = new int [n];

    scanf("%d", &A[0]); lcm = A[0];
    for(i = 1; i < n; i++){
        scanf("%d", &A[i]);
        if(lcm < A[i]){ g = gcd(A[i], lcm); }else{ g = gcd(lcm, A[i]); }
        lcm = (lcm * A[i]) / g;
    }
		
    printf("%d\n", lcm);

    return 0;
}