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;

int gcd(int a,int b){
    int temp=a;
    while(a){
        b%=a;
        temp=b;
        b=a;
        a=temp;
    }
    return b;
}

int lcm(int a,int b){
    int c=gcd(a,b);
    return a*b/c;
}

int main(){
    int n;
    int a,b;
    cin>>n;
    cin>>a;
    for(int i=1;i<n;i++){
        cin>>b;
        a=lcm(a,b);
    }
    cout<<a<<endl;

    return 0;
}

