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
2 2 2 3 2
4
1 2 4 8

Sample Output

1
2
2

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
int a[100000+5],l[100000+5],r[100000+5];
int gcd(int a,int b)
{
	return b?gcd(b,a%b):a;
}
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		memset(a,0,sizeof(a));
		memset(r,0,sizeof(r));
		memset(l,0,sizeof(l));
		int n,i,ans=1;
		cin>>n;
		for(i=0;i<n;i++)
		scanf("%d",&a[i]);
		for(i=1;i<n;i++)
		{
			if(i==1)
			l[i]=a[0];
			else if(i==2)
			l[i]=gcd(a[1],a[0]);
			else
			l[i]=gcd(l[i-1],a[i-1]);
		}
		for(i=n-2;i>=0;i--)
		{
			if(i==n-2)
			r[i]=a[n-1];
			else
			r[i]=gcd(r[i+1],a[i+1]);
		}
		l[0]=r[0],r[n-1]=l[n-1];
		for(i=0;i<n;i++)
		{
			if(ans<gcd(r[i],l[i]))
			ans=gcd(r[i],l[i]);
		}
		cout<<ans<<endl;
	}
	return 0;
}