#include<bits/stdc++.h>
#define file(F) freopen(#F".in","r",stdin),freopen(#F".out","w",stdout)
#define lowbit(x) ((x)&-(x))
#define ALL(x) x.begin(),x.end()
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define popcount(x) (__builtin_popcount((x)))
using namespace std;
using ll=long long;
using uint=uint32_t;
template<typename T>
inline bool Max(T &x,T y) { return std::less<T>()(x,y)&&(x=y,true); }
template<typename T>
inline bool Min(T &x,T y) { return std::less<T>()(y,x)&&(x=y,true); }
void Solve();
const int N = 1e5+15;
int n;
int a[N];
int cnt[N];
signed main() {
#ifndef ONLINE_JUDGE
#endif
   cin.tie(nullptr)->sync_with_stdio(false);
   int T; cin>>T; while(T--)
   Solve();
}
void Solve() {
   cin>>n;
   for(int i=1;i<=n;i++) cin>>a[i];
   for(int i=1;i<=n;i++) cnt[i]=0;
   int ans=0,ansr,ansa,ansb;
   int mx=0,mxc,ma=0,mac;
   for(int i=1;i<=n;i++) {
      ++cnt[a[i]];
      if(cnt[a[i]]>=mx) ma=mx,mac=mxc,mx=cnt[a[i]],mxc=a[i];
      else if(cnt[a[i]]>ma) ma=cnt[a[i]],mac=a[i];
      if(Max(ans,mx)) ansr=i,ansa=ansb=mxc;
      if(Max(ans,mx|ma)) ansr=i,ansa=mxc,ansb=mac;
   }
   printf("%d\n",ans);
}