#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
typedef long long ll;
int a[N],cnt[N];
int n,t;
void solve()
{
	memset(cnt,0,sizeof(cnt));
	ll sum = 0;
	cin>>n;
	for(int i = 1;i <= n;i++)
	{
		scanf("%d",&a[i]);
		cnt[a[i]]++;
	}
	sort(a+1,a+1+n);
	if(n == 2) {
		if(a[1] != a[2]) cout<<"1"<<endl;
		else cout<<"0"<<endl;
	}
	else {
		int max = a[n];
		for(int i = 1;i < n - cnt[max];i++)
		{
			if(a[i] != a[i-1])
			{
				cnt[a[i]] = cnt[a[i]] + cnt[a[i-1]];
				sum += cnt[a[i]];
			}
		}
	    cout<<sum<<endl;
	}
}
int main()
{
	cin>>t;
	while(t--)
	{
		solve();
	}
	return 0;
}