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;

long long gcd(long long a,long long b){
    return b != 0 ? gcd(b, a % b) : a;
}
long long lcm(long long a,long long b){
    return a*b/gcd(a,b);
}
long long nlcm(long long *f,int n){
    return n==0? f[0] : lcm(f[n-1],nlcm(f,n-1));
}
int main(){
    long long n;
    cin >> n;
    long long f[n];
    for(long long i=0;i<n;i++) cin >> f[i];
    cout << nlcm(f,n) << endl;
    return 0;
}

