#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<=n)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;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCgoKaW50IGZpbmRXaW5uZXIoaW50IG4sIGludCBhcnJbXSkgewogIGludCBtYXBbMTAwMF09ezB9OwogIGludCBubz1uLzI7CiAgZm9yKGludCBpPTA7aTxuO2krKyl7CiAgCW1hcFthcnJbaV1dKys7CiAgfQogIGludCBtYXhuPWFyclswXTsKICBpbnQgbWF4PW1hcFthcnJbMF1dOwogIGZvcihpbnQgaT0wO2k8bjtpKyspewogIAlpZihtYXg8bWFwW2FycltpXV0pewogIAkJbWF4PW1hcFthcnJbaV1dOwogIAkJbWF4bj1hcnJbaV07CgkgIH0KICB9CiAgaWYobWF4PD1uKXJldHVybiAtMTsgCiAgZWxzZSByZXR1cm4gbWF4bjsKfQoKaW50IG1haW4oKSB7CiAgICBpbnQgdDsKICAgIGlmICghKGNpbiA+PiB0KSkgcmV0dXJuIDA7CgogICAgd2hpbGUgKHQtLSkgewogICAgICAgIGludCBuOwogICAgICAgIGlmICghKGNpbiA+PiBuKSkgYnJlYWs7CgogICAgICAgIGludCogYXJyID0gbmV3IGludFtuXTsKICAgICAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgICAgICBjaW4gPj4gYXJyW2ldOwogICAgICAgIH0KCiAgICAgICAgY291dCA8PCBmaW5kV2lubmVyKG4sIGFycikgPDwgZW5kbDsKCiAgICAgICAgZGVsZXRlW10gYXJyOwogICAgfQoKICAgIHJldHVybiAwOwp9