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>
#define int long long
using namespace std;
int n,a[10005];
int gcd(int a,int b)
{
    if (b==0) return a;
    else return gcd(b,a%b);
}
int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n;
    for (int i=1;i<=n;i++)
        cin>>a[i];
    int ans=a[1]*a[2]/gcd(a[1],a[2]);
    for (int i=3;i<=n;i++)
    {
        int p=gcd(ans,a[i]);
        p=ans*a[i]/p;
        ans=p;
    }
    cout<<ans<<"\n";
    return 0;
}

