coprime sequence

Do you know what is called ``Coprime Sequence''? That is a sequence consists of nnpositive 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)T(1≤T≤10), denoting the number of test cases. 
In each test case, there is an integer n(3≤n≤100000)n(3≤n≤100000) in the first line, denoting the number of integers in the sequence. 
Then the following line consists of nn integers a1,a2,...,an(1≤ai≤109)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

#include <stdio.h>
#include <string.h>
#include <algorithm>
//using namespace std;
int max(int a,int b)
{
	if(a>b) return a;
	else return b;
}
int a[100010],pre[100010],next[100010];
int gcd(int a,int b)
{
	return b?gcd(b,a%b):a;
}
int main()
{
	int n,r,t,ans,i;
	scanf("%d",&t);
	while(t--)
	{
		memset(pre,0,sizeof(pre));
		memset(next,0,sizeof(next));
		scanf("%d",&n);
		for(i=0;i<n;i++)
		scanf("%d",&a[i]);
		pre[0]=a[0];
		for(i=1;i<n;i++)
		pre[i]=gcd(pre[i-1],a[i]);
		next[n-1]=a[n-1];
		for(i=n-2;i>=0;i--)
		{
			next[i]=gcd(next[i+1],a[i]);
		}
		ans=max(pre[n-2],next[1]);
		for(i=1;i<n-1;i++)
		ans=max(ans,gcd(pre[i-1],next[i+1]));
		printf("%d\n",ans);
	}
	
}

2 2 2 3 2
4
1 2 4 8

Sample Output

1
2
2

pre[i]代表从前向后前(i+1)个数的公约数，next[i]代表后（n-i)个数的公约数，这题不好想啊，表示不会。。。。。。