#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
	int n;
	cin >> n;
	vector<int> a(n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	int ma = *max_element(a.begin() + 1, a.end());
	map<int,int> cnt;
	for(int i = 1;i<=n;i++) cnt[a[i]]++;
	int ans = 0;
	for(int i = 1;i<=n;i++) if(a[i] != ma) ans++;
	int diff = 0;
	for(auto i:cnt) diff++;
	cout<<diff - 1 + max(0ll,ans - 1) <<endl;
}
signed main(){
	int T; cin>>T; while(T--)
	solve();
	return 0;
}