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<stdio.h>
#include<iostream>

using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0;i<(int)(n);i++)

ll gcd(ll p, ll q){
    if(p < q)std::swap(p,q);
    if(p % q == 0) return q;
    else return gcd(q, p%q);
}

ll lcm(ll p, ll q){
    return p*q/gcd(p,q);
}

int main(){
    int n;
    int a[11];
    cin >> n;
    REP(i,n)cin >> a[i];
    ll ans=a[0];
    REP(i,n-1){
        ans = lcm(ans, a[i+1]);
    }
    cout << ans << endl;
}
