#include <bits/stdc++.h>
using namespace std;
// Speed
#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
// Typedefs
#define int long long
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define endl '\n'
// Loops
#define rep(i,a,b) for(int i=a;i<b;++i)
#define each(x, a) for (auto &x : a)
int distinct_count(vector<int> &v) {
unordered_set<int> st(all(v));
return st.size();
}
// Logic
void solve() {
int n;
cin>>n;
vector <int> a(n);
rep(i,0,n) cin>>a[i];
int b=distinct_count(a);
int c;
sort(all(a));
rep(i,0,n){
if(a[i]>b){
c=a[i];
break;
}
}
cout<<c<<endl;
}
// Main
int32_t main() {
fast_io;
int t;
cin>>t;
while (t--) solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgovLyBTcGVlZAojZGVmaW5lIGZhc3RfaW8gaW9zOjpzeW5jX3dpdGhfc3RkaW8oMCk7IGNpbi50aWUoMCk7IGNvdXQudGllKDApCgovLyBUeXBlZGVmcwojZGVmaW5lIGludCBsb25nIGxvbmcKI2RlZmluZSBwYiBwdXNoX2JhY2sKI2RlZmluZSBmZiBmaXJzdAojZGVmaW5lIHNzIHNlY29uZAojZGVmaW5lIGFsbCh4KSAoeCkuYmVnaW4oKSwgKHgpLmVuZCgpCiNkZWZpbmUgcmFsbCh4KSAoeCkucmJlZ2luKCksICh4KS5yZW5kKCkKI2RlZmluZSBzeih4KSAoKGludCkoeCkuc2l6ZSgpKQojZGVmaW5lIGVuZGwgJ1xuJwoKLy8gTG9vcHMKI2RlZmluZSByZXAoaSxhLGIpIGZvcihpbnQgaT1hO2k8YjsrK2kpCiNkZWZpbmUgZWFjaCh4LCBhKSBmb3IgKGF1dG8gJnggOiBhKQoKaW50IGRpc3RpbmN0X2NvdW50KHZlY3RvcjxpbnQ+ICZ2KSB7CiAgICB1bm9yZGVyZWRfc2V0PGludD4gc3QoYWxsKHYpKTsKICAgIHJldHVybiBzdC5zaXplKCk7Cn0KCi8vIExvZ2ljCnZvaWQgc29sdmUoKSB7CiAgICBpbnQgbjsKICAgIGNpbj4+bjsKICAgIHZlY3RvciA8aW50PiBhKG4pOwogICAgcmVwKGksMCxuKSBjaW4+PmFbaV07CiAgICBpbnQgYj1kaXN0aW5jdF9jb3VudChhKTsKICAgIGludCBjOwogICAgc29ydChhbGwoYSkpOwogICAgcmVwKGksMCxuKXsKICAgIAlpZihhW2ldPmIpewogICAgCQljPWFbaV07CiAgICAJCWJyZWFrOwogICAgCX0KICAgIH0KICAgIGNvdXQ8PGM8PGVuZGw7Cn0KCgovLyBNYWluCmludDMyX3QgbWFpbigpIHsKICAgIGZhc3RfaW87CiAgICBpbnQgdDsKICAgIGNpbj4+dDsKICAgIHdoaWxlICh0LS0pIHNvbHZlKCk7CiAgICByZXR1cm4gMDsKfQo=