For the multiset of positive integers s= {s_1,s_2, ... ,s_k } , define the Greatest Common Divisor (GCD) and Least Common Multiple (LCM) of s as follow: For example, gcd( {8,12 })=4, gcd( {12,18,6 })=6 and textrm{lcm}( {4,6 })=12 . Note that for any positive integer x , gcd( {x })= textrm{lcm}( {x })=x . Orac has a sequence a with length n . He come up with the multiset t= { textrm{lcm}( {a_i,a_j }) | i<j } , and asked you to find the value of gcd(t) for him. In other words, you need to calculate the GCD of LCMs of all pairs of elements in the given sequence. The first line contains one integer n (2 <= n <= 100 ,000) . The second line contains n integers, a_1, a_2, ldots, a_n ( 1 <= q a_i <= q 200 ,000 ). Print one integer: gcd( { textrm{lcm}( {a_i,a_j }) | i<j }) . For the first example, t= { textrm{lcm}( {1,1 }) }= {1 } , so gcd(t)=1 . For the second example, t= {120,40,80,120,240,80 } , and it's not hard to see that gcd(t)=40 .