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

using namespace std;

int gcd(int x,int y){
    if(x<y){
        int tmp=x;
        x=y;
        y=tmp;
    }
    if(x%y==0)return y;
    else return gcd(y,x%y);
}

int main(void)
{
    int n;
    int a[10];
    int temp;

    cin>>n;
    for(int i=0;i<n;i++)cin>>a[i];
    temp=a[0];
    for(int i=1;i<n;i++){
        temp=(temp*a[i])/gcd(temp,a[i]);
    }
    cout<<temp<<endl;
    return 0;
}
