We have N clocks. The hand of the i-th clock (1≤i≤N) rotates through 360° in exactly T_i seconds.
Initially, the hand of every clock stands still, pointing directly upward.
Now, Dolphin starts all the clocks simultaneously.
In how many seconds will the hand of every clock point directly upward again?

Constraints

* 1≤N≤100
* 1≤T_i≤10^{18}
* All input values are integers.
* The correct answer is at most 10^{18} seconds.

Input

Input is given from Standard Input in the following format:


N
T_1
:
T_N


Output

Print the number of seconds after which the hand of every clock point directly upward again.

Examples

Input

2
2
3


Output

6


Input

5
2
5
10
1000000000000000000
1000000000000000000


Output

1000000000000000000
import sys
sys.setrecursionlimit(1000000)

def gcd(a,b):
    if b==0:
        return a
    return gcd(b,a%b)

def lcm(a,b):
    g=gcd(a,b)
    return a/g*b

n = int(raw_input())
t = [int(raw_input()) for _ in xrange(n)]
ans = 1
for i in xrange(n):
    ans = lcm(ans, t[i])
print ans
