#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

int distinctAtmostK(int n, int k){
	
	unordered_map<int,int> mp;
	
	int s = 0,  e = 0;
	int ct = 0;
	
	while(e<n){
		mp[a[e]]++;
		
		while(s<=e && mp.size() > k){
			mp[a[s]]--;
			if(mp[a[s]] == 0) mp.erase(a[s]);
			s++;
		}
		
		ct += e-s+1;
		e++;
	}
	return ct;
}

int consistency(int n){

	int total = n*(n+1)/2;
	int t = (total+1)/2; // ceil
	
	
	//* 1 distinct element
	int s = 1;
	
	//* max distinct elements in a[ ] 
	int e = n;
	
	while(s<e){
		int mid = s + (e-s)/2;
		
		if(distinctAtmostK(n, mid) >= t){
			e = mid;
		}
		else s = mid+1;
	}
	
	
	return e;
}















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}