Problem:
Score : 300 points

Problem Statement

There are N integers, A_1, A_2, ..., A_N, written on the blackboard.

You will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.

Find the maximum possible greatest common divisor of the N integers on the blackboard after your move.

Constraints

All values in input are integers.

2 \leq N \leq 10^5

1 \leq A_i \leq 10^9

Output

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the maximum possible greatest common divisor of the N integers on the blackboard after your move.

Sample Input 1

3
7 6 8

Sample Output 1

2

If we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.

Sample Input 2

3
12 15 18

Sample Output 2

6

Sample Input 3

2
1000000000 1000000000

Sample Output 3

1000000000

We can replace an integer with itself.

Solution in Fortran (gfortran v4.8.4) (judge verdict: Wrong Answer)

integer n
integer(16),allocatable,dimension(:)::A
integer(16) gcd,pre,ans
read*,n
allocate(A(n))
read*,A

ans=A(2)
do j=2,N
  ans=getgcd(A(j),ans)
end do
!ansの初期値
pre=A(1)
!preの初期値
do i=2,N-1
  gcd=pre
  do j=i+1,N
    gcd=getgcd(A(j),gcd)
    if(gcd==1)exit
  end do
  ans=max(ans,gcd)
  pre=getgcd(A(i+1),pre)
end do
ans=max(ans,pre)
print"(I0)",ans

contains

pure function getgcd(a,b)
integer(16),intent(in)::a,b
integer(16) getgcd
integer(16) s,t
s=a+b
getgcd=b

t=mod(a+b,b)
do while(t/=0)
  s=getgcd
  getgcd=t
  t=mod(s,getgcd)
end do
end function getgcd
end