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;

typedef long long ll;

ll gcd(ll a,ll b)
{
    return a%b?gcd(b,a%b):b;
}

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

int main()
{
    int n;

    while(cin>>n)
    {
        int ans=1;
        while(n--)
        {
            int a;
            cin>>a;
            ans=lcm(ans,a);
        }
        cout<<ans<<endl;
    }

    return 0;
}

