You are given an array aa consisting of nn positive integers. You have to choose a positive integer dd and paint all elements into two colors. All elements which are divisible by dd 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 dd which yields a beautiful coloring, or report that it is impossible.
Input
The first line contains a single integer tt (1≤t≤1000) — the number of testcases.
The first line of each testcase contains one integer nn (2≤n≤100) — the number of elements of the array.
The second line of each testcase contains nn integers a1,a2,…,an (1≤ai≤1018).
Output
For each testcase print a single integer. If th
最低0.47元/天 解锁文章
821
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
