#include<bits/stdc++.h>
#define ll long long 
#define fi first
#define se second
#define pb push_back
#define inf 0x3f3f3f3f
using namespace std;
const int N=3e5+5;
//不会贪心 
int T,n,a[N],lsh[N],cnt,c[N],fk[N],it,flg;
int get(int x){
	return lower_bound(lsh+1,lsh+1+cnt,x)-lsh;
}
void cng(int x){
	fk[x]++;
	it=min(it,x);
}
int main(){
//    freopen("data.in","r",stdin);
//    freopen("puzzle.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>T;
    while(T--){
    	cin>>n,cnt=0;
    	for(int i=1;i<=n;i++)cin>>a[i],lsh[++cnt]=a[i];
    	sort(lsh+1,lsh+1+cnt),cnt=unique(lsh+1,lsh+1+cnt)-lsh-1;
    	for(int i=1;i<=cnt;i++)c[i]=0;
    	for(int i=1;i<=n;i++)c[get(a[i])]++;
    	for(int i=1;i<=n;i++)fk[i]=0;
    	flg=0,it=n+1;int res=n-cnt+1;
		for(int i=1;i<cnt;i++){
    		if(flg){
    			//需要c[i]+1次才能搞定 
    			cng(c[i]),flg=0;
			}
			else if(c[i]<=it){
				if(c[i]==1)flg=1,res++;
				else cng(c[i]-1);
			}
			else{
				fk[it]--,cng(c[i]-1);
				if(it==1){
					flg=1,res++;
					while(it<=n&&!fk[it])it++;
				}
				else{
					cng(it-1);
				}
			}
		}
		cout<<res-flg<<"\n";
	}
}