You are given an array a consisting of n positive integers. You have to choose a positive integer d and paint all elements into two colors. All elements which are divisible by d will be painted red, and all other elements will be painted blue.

The coloring is called beautiful if there are no pairs of adjacent elements with the same color in the array. Your task is to find any value of d which yields a beautiful coloring, or report that it is impossible.

Input

The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of testcases.

The first line of each testcase contains one integer n (2 ≤ n ≤ 100) — the number of elements of the array.

The second line of each testcase contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^{18}).

Output

For each testcase print a single integer. If there is no such value of d that yields a beautiful coloring, print 0. Otherwise, print any suitable value of d (1 ≤ d ≤ 10^{18}).

Example

Input


5
5
1 2 3 4 5
3
10 5 15
3
100 10 200
10
9 8 2 6 6 2 8 6 5 4
2
1 3


Output


2
0
100
0
3
1
5
6 5 12 5 16
 1
5
3 5 6 11 2

2
 0

//package currentContest;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Random;
import java.util.StringTokenizer;


public class P1 {
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		FastReader sc=new FastReader();
		int t=sc.nextInt();
		StringBuilder st=new StringBuilder();
		while(t--!=0){
			int n=sc.nextInt();
			long a[]=new long[n];
			for(int i=0;i<n;i++) {
				a[i]=sc.nextLong();
			}
			long gcd1=-1;
			for(int i=0;i<n;i+=2) {
				if(gcd1==-1) {
					gcd1=a[i];
				}else {
					gcd1=gcd(gcd1, a[i]);
				}
			}
			long gcd2=-1;
			for(int i=1;i<n;i+=2) {
				if(gcd2==-1) {
					gcd2=a[i];
				}else {
					gcd2=gcd(gcd2, a[i]);
				}
			}
			if(gcd1==gcd2) {
				st.append("0");
			}else {
				int flag=0;
				for(int i=0;i<n;i+=2) {
					if(a[i]%gcd2==0) {
						flag=1;
					}
				}
				if(flag==0) {
					st.append(gcd2);
				}else {
					flag=0;
					for(int i=1;i<n;i+=2) {
						if(a[i]%gcd1==0) {
							flag=1;
						}
					}
					if(flag==0) {
						st.append(gcd1);
					}else {
						st.append("0");
					}
				}
			}
			st.append("\n");
		}
		System.out.println(st);
	}
	
	static class DisjointUnionSets {
		int[] rank, parent;
		int n;
		
		// Constructor
		public DisjointUnionSets(int n)
		{
			rank = new int[n];
			parent = new int[n];
			this.n = n;
			makeSet();
		}
		
		// Creates n sets with single item in each
		void makeSet()
		{
			for (int i = 0; i < n; i++) {
				// Initially, all elements are in
				// their own set.
				parent[i] = i;
			}
		}
		
		// Returns representative of x's set
		int find(int x)
		{
			// Finds the representative of the set
			// that x is an element of
			if (parent[x] != x) {
				// if x is not the parent of itself
				// Then x is not the representative of
				// his set,
				parent[x] = find(parent[x]);
				
				// so we recursively call Find on its parent
				// and move i's node directly under the
				// representative of this set
			}
			
			return parent[x];
		}
		
		// Unites the set that includes x and the set
		// that includes x
		void union(int x, int y)
		{
			// Find representatives of two sets
			int xRoot = find(x), yRoot = find(y);
			
			// Elements are in the same set, no need
			// to unite anything.
			if (xRoot == yRoot)
				return;
			
			// If x's rank is less than y's rank
			if (rank[xRoot] < rank[yRoot])
				
				// Then move x under y  so that depth
				// of tree remains less
				parent[xRoot] = yRoot;
			
			// Else if y's rank is less than x's rank
			else if (rank[yRoot] < rank[xRoot])
				
				// Then move y under x so that depth of
				// tree remains less
				parent[yRoot] = xRoot;
			
			else // if ranks are the same
			{
				// Then move y under x (doesn't matter
				// which one goes where)
				parent[yRoot] = xRoot;
				
				// And increment the result tree's
				// rank by 1
				rank[xRoot] = rank[xRoot] + 1;
			}
		}
	}

	static FastReader sc = new FastReader();

	public static void solvegraph() {
		int n = sc.nextInt();

		int edge[][] = new int[n - 1][2];
		for (int i = 0; i < n - 1; i++) {
			edge[i][0] = sc.nextInt() - 1;
			edge[i][1] = sc.nextInt() - 1;
		}
		ArrayList<ArrayList<Integer>> ad = new ArrayList<>();
		for (int i = 0; i < n; i++) {
			ad.add(new ArrayList<Integer>());
		}
		for (int i = 0; i < n - 1; i++) {
			ad.get(edge[i][0]).add(edge[i][1]);
			ad.get(edge[i][1]).add(edge[i][0]);
		}
		int parent[] = new int[n];
		Arrays.fill(parent, -1);
		parent[0] = n;
		ArrayDeque<Integer> queue = new ArrayDeque<>();
		queue.add(0);
		int child[] = new int[n];
		Arrays.fill(child, 0);
		ArrayList<Integer> lv = new ArrayList<Integer>();
		while (!queue.isEmpty()) {
			int toget = queue.getFirst();
			queue.removeFirst();
			child[toget] = ad.get(toget).size() - 1;
			for (int i = 0; i < ad.get(toget).size(); i++) {
				if (parent[ad.get(toget).get(i)] == -1) {
					parent[ad.get(toget).get(i)] = toget;
					queue.addLast(ad.get(toget).get(i));
				}
			}
			lv.add(toget);
		}

		child[0]++;
	}

	static void sort(int[] A) {
		int n = A.length;
		Random rnd = new Random();
		for (int i = 0; i < n; ++i) {
			int tmp = A[i];
			int randomPos = i + rnd.nextInt(n - i);
			A[i] = A[randomPos];
			A[randomPos] = tmp;
		}
		Arrays.sort(A);
	}

	static void sort(long[] A) {
		int n = A.length;
		Random rnd = new Random();
		for (int i = 0; i < n; ++i) {
			long tmp = A[i];
			int randomPos = i + rnd.nextInt(n - i);
			A[i] = A[randomPos];
			A[randomPos] = tmp;
		}
		Arrays.sort(A);
	}

	static String sort(String s) {
		Character ch[] = new Character[s.length()];
		for (int i = 0; i < s.length(); i++) {
			ch[i] = s.charAt(i);
		}
		Arrays.sort(ch);
		StringBuffer st = new StringBuffer("");
		for (int i = 0; i < s.length(); i++) {
			st.append(ch[i]);
		}
		return st.toString();
	}

	public static long gcd(long a, long b) {
		if (a == 0) {
			return b;
		}
		return gcd(b % a, a);
	}

	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}
}
