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 n, int m) {
    int r;
    if (n < m) swap(n, m);
    
    while( m > 0 ){
        r = n % m;
        n = m;
        m = r;
    }
    return n;
}

int main(void){
    int n, x, y;
    cin >> n;
    cin >> x;
    for (int i = 0; i < n - 1; i++) {
        cin >> y;
        x = x * y / gcd(x, y);
    }
    cout << x << endl;;
    return 0;
}

