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 <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
long long gcd(long long a, long long b) {
    if (b==0)return a;
    else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
    return a / gcd(a, b) * b;
}
int main(){
ll n;
cin >> n;
ll a[n];
ll least = 1;
for (ll i = 0; i < n; i++) cin >> a[i];
for (ll i = 0; i < n;i++){
    least = lcm(least, a[i]);
}
cout << least << endl;
}
