from math import gcd
for _ in range(int(input())):
n=int(input())
l=list(map(int,input().strip().split()))
l1=l[::2]
l2=l[1::2]
a,b=l1[0],l2[0]
if len(l1)>1:
for i in range(1,n//2+n%2):
a=gcd(l1[i],a)
if a==1:
break
if len(l2)>1:
for i in range(1,n//2):
b=gcd(l2[i],b)
if b==1:
break
if a>1:
for i in range(n//2):
if l2[i]%a==0:
a=1
break
if b>1:
for i in range(n//2+n%2):
if l1[i]%b==0:
b=1
break
if a==b:
print(0)
else:
print(max(a,b))#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
ll t;
cin >> t;
while (t--)
{
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
{
cin >> a[i];
}
bool flag = true;
ll var;ll x=0,y=0;bool ok=true;
for (ll i = 0; i < n; i++)
{
if(i%2==0){
x=__gcd(x,a[i]);
}
else{
y=__gcd(y,a[i]);
}
}
for(int i=0;i<n;i++){
if(i%2==0 && a[i]%y==0){
flag=false;
}
else if(i%2!=0 && a[i]%x==0){
ok=false;
}
}
if (flag == true)
{
cout <<y<< endl;
}
else if (ok == true)
{
cout <<x<< endl;
}
else
{
cout << 0 << endl;
}
}
return 0;
}232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |