coprime sequence

Do you know what is called ``Coprime Sequence''? That is a sequence consists of n

positive integers, and the GCD (Greatest Common Divisor) of them is equal to 1.
``Coprime Sequence'' is easy to find because of its restriction. But we can try to maximize the GCD of these integers by removing exactly one integer. Now given a sequence, please maximize the GCD of its elements.

Input

The first line of the input contains an integer T(1≤T≤10)

, denoting the number of test cases.
In each test case, there is an integer n(3≤n≤100000) in the first line, denoting the number of integers in the sequence.
Then the following line consists of n integers a1,a2,...,an(1≤ai≤109)

, denoting the elements in the sequence.

Output

For each test case, print a single line containing a single integer, denoting the maximum GCD.

Sample Input

3
3
1 1 1
5
2 2 2 3 2
4
1 2 4 8

Sample Output

1
2
2

可以考虑从左到右求出连续前0，1，2～个一直到前n个的gcd并保存起来，
然后考虑从右到左也求出gcd并保存其起来，可以想一下二分的循环，然后
求去掉某个数字后的gcd,可以求出前i-1个与后i+1个的gcd,并循环的最大值

#include<bits/stdc++.h>
#define M 100005
using namespace std;
int a[M],l[M],r[M];
int gcd(int a,int b)
{
	return b?gcd(b,a%b):a;
}
int main()
{
	int t;
	scanf("%d",&t);
	while (t--)
	{
		int i,n;
		scanf("%d",&n);
		for (i=0;i<n;i++)
			scanf("%d",&a[i]);
		l[0] = a[0];
		r[n-1] = a[n-1];
		for (i=1;i<n;i++)
			l[i] = gcd(l[i-1],a[i]);
		for (i=n-2;i>=0;i--)
			r[i] = gcd(r[i+1],a[i]);
		int ans = max(l[n-2],r[1]);//去掉两端点时的最大值 
		for (i=1;i<n-1;i++)
			ans = max(ans,gcd(l[i-1],r[i+1]));//去掉中间点
		printf("%d\n",ans);
	}
	return 0;
}