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<stdio.h>
#include<algorithm>

using namespace std;

const int maxn = 1e5 + 10;
int a[maxn], b[maxn], c[maxn];

int gcd(int a, int b){
	return b ? gcd(b, a % b) : a;
}

int main()
{
	int t;
	scanf ("%d", &t);
	while(t--){
		int n; scanf ("%d", &n);
		for (int i = 0; i < n; i++)
			scanf ("%d", a+i);
		b[0] = a[0], c[n-1] = a[n-1];
		for (int i = 1; i < n; i++) // 求前缀gcd 
			b[i] = gcd(b[i-1], a[i]);
		for (int i = n-2; i >= 0; i--) // 求后缀gcd 
			c[i] = gcd(c[i+1], a[i]);
		int ans = max(b[n-2], c[1]);
		for (int i = 1; i < n-1; i++) //遍历求最大值 
			ans = max(ans, gcd(b[i-1], c[i+1]));
		printf ("%d\n", ans);
	}
	return 0;
}