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;

typedef long long ll;

ll gcd(ll a, ll b){
    if(a % b == 0) return b;
    else return (gcd(b, a % b));
}

ll lcm(ll a, ll b){
    return (a / gcd(a, b) * b);
}

int main(void){
    int n;
    cin >> n;
    int a[n];

    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    int ans = a[0];
    for(int i = 0; i < n; i++){
        ans = lcm(ans, a[i]);
    }
    cout << ans << endl;
}

