#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int findWinner(int n, int arr[]) {
int map[1000]={0};
int no=n/2;
for(int i=0;i<n;i++){
map[arr[i]]++;
}
int maxn=arr[0];
int max=map[arr[0]];
for(int i=0;i<n;i++){
if(max<map[arr[i]]){
max=map[arr[i]];
maxn=arr[i];
}
}
if(max<=no)return -1;
else return maxn;
}
int main() {
int t;
if (!(cin >> t)) return 0;
while (t--) {
int n;
if (!(cin >> n)) break;
int* arr = new int[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << findWinner(n, arr) << endl;
delete[] arr;
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCgoKaW50IGZpbmRXaW5uZXIoaW50IG4sIGludCBhcnJbXSkgewogIGludCBtYXBbMTAwMF09ezB9OwogIGludCBubz1uLzI7CiAgZm9yKGludCBpPTA7aTxuO2krKyl7CiAgCW1hcFthcnJbaV1dKys7CiAgfQogIGludCBtYXhuPWFyclswXTsKICBpbnQgbWF4PW1hcFthcnJbMF1dOwogIGZvcihpbnQgaT0wO2k8bjtpKyspewogIAlpZihtYXg8bWFwW2FycltpXV0pewogIAkJbWF4PW1hcFthcnJbaV1dOwogIAkJbWF4bj1hcnJbaV07CgkgIH0KICB9CiAgaWYobWF4PD1ubylyZXR1cm4gLTE7IAogIGVsc2UgcmV0dXJuIG1heG47Cn0KCmludCBtYWluKCkgewogICAgaW50IHQ7CiAgICBpZiAoIShjaW4gPj4gdCkpIHJldHVybiAwOwoKICAgIHdoaWxlICh0LS0pIHsKICAgICAgICBpbnQgbjsKICAgICAgICBpZiAoIShjaW4gPj4gbikpIGJyZWFrOwoKICAgICAgICBpbnQqIGFyciA9IG5ldyBpbnRbbl07CiAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICAgICAgY2luID4+IGFycltpXTsKICAgICAgICB9CgogICAgICAgIGNvdXQgPDwgZmluZFdpbm5lcihuLCBhcnIpIDw8IGVuZGw7CgogICAgICAgIGRlbGV0ZVtdIGFycjsKICAgIH0KCiAgICByZXR1cm4gMDsKfQ==