#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int t, n;
scanf ("%d", &t);
for (t; t > 0; --t)
{
int a[100000];
scanf ("%d", &n);
for (int i = 0; i < n; ++i)
{
scanf ("%d", &a[i]);
}
sort (a, a + n);
for (int j = 2; j <= a[0]; ++j)
{
int ans = 0;
for (int i = 0; i < n; ++i)
{
if (a[i] % j != 0)
{
break;
}
else
{
ans = ans + 1;
}
}
if (ans == n)
{
printf ("%d\n", j);
break;
}
else
{
printf ("%d\n", -1);
break;
}
}
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y3N0ZGlvPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgbWFpbigpIAp7CglpbnQgdCwgbjsKCXNjYW5mICgiJWQiLCAmdCk7Cglmb3IgKHQ7IHQgPiAwOyAtLXQpCgl7CgkJaW50IGFbMTAwMDAwXTsKCQlzY2FuZiAoIiVkIiwgJm4pOwoJCWZvciAoaW50IGkgPSAwOyBpIDwgbjsgKytpKQoJCXsKCQkJc2NhbmYgKCIlZCIsICZhW2ldKTsKCQl9CgkJc29ydCAoYSwgYSArIG4pOwoJCQlmb3IgKGludCBqID0gMjsgaiA8PSBhWzBdOyArK2opCgkJCXsKCQkJCWludCBhbnMgPSAwOwoJCQkJZm9yIChpbnQgaSA9IDA7IGkgPCBuOyArK2kpCgkJCQl7CgkJCQkJaWYgKGFbaV0gJSBqICE9IDApCgkJCQkJewoJCQkJCQlicmVhazsKCQkJCQl9CQoJCQkJCWVsc2UKCQkJCQl7CgkJCQkJCWFucyA9IGFucyArIDE7CgkJCQkJfQkKCQkJCX0KCQkJCWlmIChhbnMgPT0gbikKCQkJCXsJCgkJCQkJcHJpbnRmICgiJWRcbiIsIGopOwoJCQkJCWJyZWFrOwoJCQkJfQkKCQkJCWVsc2UgCgkJCQl7CgkJCQkJcHJpbnRmICgiJWRcbiIsIC0xKTsKCQkJCQlicmVhazsKCQkJCX0JCgkJfQkKCX0KCXJldHVybiAwOwp9