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

import java.util.*;
import java.lang.*;
import java.io.*;

public class Codechef {
	static long fans[] = new long[200001];
	static long inv[] = new long[200001];
	static long mod = 1000000007;

	static void init() {
		fans[0] = 1;
		inv[0] = 1;
		fans[1] = 1;
		inv[1] = 1;
		for (int i = 2; i < 200001; i++) {
			fans[i] = ((long) i * fans[i - 1]) % mod;
			inv[i] = power(fans[i], mod - 2);
		}
	}

	static long ncr(int n, int r) {
		return (((fans[n] * inv[n - r]) % mod) * (inv[r])) % mod;
	}

	public static void main(String[] args) throws java.lang.Exception {
		FastReader in = new FastReader(System.in);
		StringBuilder sb = new StringBuilder();
		int t = 1;
		t = in.nextInt();
		while (t > 0) {
			--t;
			int n = in.nextInt();
			long arr[] = generateArray(in, n);
			long g1 = arr[0];
			long g2 = arr[1];
			for(int i = 0,j = 1;i<n || j<n;i+=2,j+=2)
			{
				if(i<n)
				g1 = gcd(g1,arr[i]);
				if(j<n)
				g2 = gcd(g2,arr[j]);
			}
			boolean found = true;
			for(int i = 0;i<n;i++)
			{
				if(i%2 == 0)
				{
					if(i+1<n && arr[i+1]%g1 == 0)
						found = false;
					if(i-1>=0 && arr[i-1]%g1 == 0)
						found = false;
				}
			}
			if(found) {
				sb.append(g1+"\n");
				continue;
			}
			found = true;
			for(int i = 0;i<n;i++)
			{
				if(i%2 == 1)
				{
					if(i+1<n && arr[i+1]%g2 == 0)
						found = false;
					if(i-1>=0 && arr[i-1]%g2 == 0)
						found = false;
				}
			}
			if(found)
				sb.append(g2+"\n");
			else 
				sb.append("0\n");

		}
		System.out.print(sb);
	}

	static long power(long x, long y) {
		long res = 1; // Initialize result

		while (y > 0) {

			// If y is odd, multiply x with result
			if ((y & 1) != 0)
				res = ((res % mod) * (x % mod)) % mod;

			// y must be even now
			y = y >> 1; // y = y/2
			x = ((x % mod) * (x % mod)) % mod; // Change x to x^2
		}
		return res;
	}

	static long[] generateArray(FastReader in, int n) throws IOException {
		long arr[] = new long[n];
		for (int i = 0; i < n; i++)
			arr[i] = in.nextLong();
		return arr;
	}

	static long[][] generatematrix(FastReader in, int n, int m) throws IOException {
		long arr[][] = new long[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				arr[i][j] = in.nextLong();
			}
		}
		return arr;
	}

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

	static long lcm(long a, long b) {
		return (a / gcd(a, b)) * b;
	}

	static void sort(long[] a) {
		ArrayList<Long> l = new ArrayList<>();
		for (long i : a)
			l.add(i);
		Collections.sort(l);
		for (int i = 0; i < a.length; i++)
			a[i] = l.get(i);
	}
}

class FastReader {

	byte[] buf = new byte[2048];
	int index, total;
	InputStream in;

	FastReader(InputStream is) {
		in = is;
	}

	int scan() throws IOException {
		if (index >= total) {
			index = 0;
			total = in.read(buf);
			if (total <= 0) {
				return -1;
			}
		}
		return buf[index++];
	}

	String next() throws IOException {
		int c;
		for (c = scan(); c <= 32; c = scan())
			;
		StringBuilder sb = new StringBuilder();
		for (; c > 32; c = scan()) {
			sb.append((char) c);
		}
		return sb.toString();
	}

	String nextLine() throws IOException {
		int c;
		for (c = scan(); c <= 32; c = scan())
			;
		StringBuilder sb = new StringBuilder();
		for (; c != 10 && c != 13; c = scan()) {
			sb.append((char) c);
		}
		return sb.toString();
	}

	char nextChar() throws IOException {
		int c;
		for (c = scan(); c <= 32; c = scan())
			;
		return (char) c;
	}

	int nextInt() throws IOException {
		int c, val = 0;
		for (c = scan(); c <= 32; c = scan())
			;
		boolean neg = c == '-';
		if (c == '-' || c == '+') {
			c = scan();
		}
		for (; c >= '0' && c <= '9'; c = scan()) {
			val = (val << 3) + (val << 1) + (c & 15);
		}
		return neg ? -val : val;
	}

	long nextLong() throws IOException {
		int c;
		long val = 0;
		for (c = scan(); c <= 32; c = scan())
			;
		boolean neg = c == '-';
		if (c == '-' || c == '+') {
			c = scan();
		}
		for (; c >= '0' && c <= '9'; c = scan()) {
			val = (val << 3) + (val << 1) + (c & 15);
		}
		return neg ? -val : val;
	}
}