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 <bits/stdc++.h>

using namespace std;

int gcd(int a, int b)
{
    if(b==0)
        return a;
    gcd(b, a%b);
}

int main ()
{
    int n;
    while(cin>>n)
    {
        int a[100];
        for(int i=0; i<n; i++)
            cin>>a[i];
        int lcm= (a[0]*a[1])/gcd(a[0], a[1]);
        for(int i=2; i<n; i++)
        {
            lcm= (lcm*a[i])/gcd(lcm,a[i]);
        }
        cout<<lcm<<endl;
    }
    return 0;
}

