#555 整齐的数组2

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}

int n;
int a[10010];

bool check (int x) {
	map<int, int> tmp;	
	for(int i = 1; i <= n; i ++) {
		tmp[(a[i] %x + x)%x] ++;
	}
	for (auto [x, cnt] : tmp)
		if (cnt >= n / 2) return 1;
	return 0;
}
void solve() {
	cin >> n;
	map<int, int> cnt;
	for (int i = 1;  i<= n; i ++) {
		cin >> a[i];
		cnt[a[i]] ++;
	}
	for (int i = 1; i <= n; i ++)
		if (cnt[a[i]] >= n / 2) {
			puts("-1");
			return;
		}
	sort(a +1, a+ 1 + n);
	int ans = 1;
	for (int i = 1; i <= n; i ++) {
		for (int j = i + 1; j <= n; j ++) {
			int res = a[j] - a[i];
			for (int k = 1 ; k * k<= res; k ++) {
				if (res % k == 0 ){
					if (check(k)) ans = max(ans, k);
					if (check(res / k))
						ans = max (ans, res /k);
				}
			}
		}
	}	
	cout << ans << endl;
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    cin >> t;
    while (t --) solve();
    return 0;
}

a[i] - k * x= a[j] - k * y a[i] %k = a[j] %k 这个歌性质可以用来检查使用