#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long LL;
#define endl '\n'
#define per(i, a, b) for(int i = (a); i >= (b); i--)
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
typedef pair<int,int> PII;
#define ld double
const int N=2e6+10;


#define lowbit(x) (x&-x)

ll n;
int tree[N];
long long a[N];
ld b[N];
vector<double>mp;

int query(int k)//求1-k的和
{
	int ans=0;
	for(int i=k;i>0;i-=lowbit(i)) ans+=tree[i];
	return ans;
}

void add(int x,int k)//x位置+k
{
	if(x==0) return; 
	for(int i=x;i<N;i+=lowbit(i)) tree[i]+=k;
}

void solve()
{
	cin>>n;
	for(int i=1;i<=2*n;i++) tree[i]=0;
	unordered_map<ld,int>to;
	int cnt=0;
	for(int i=1;i<=n;i++)
	{
		cin >> a[i];
		mp.push_back(a[i]);
		if(a[i]^1) b[i] = (ld)a[i] / (a[i] - 1);
		if(a[i]^1) mp.push_back(b[i]);
	}
	sort(mp.begin(),mp.end());//先排序
	mp.erase(unique(mp.begin(),mp.end()),mp.end());//后去重
	for(auto x:mp)
	{
		to[x]=++cnt;
	}
	mp.resize(0);
	ll ans=0;
	for(int i=1;i<=n;i++)
	{
		if(!(a[i]^1))
		{
			ans+=i-1;
		}
		else if(a[i]>1)
		{
			ans+=query(to[b[i]]-1);
		}
		else
		{
			ans+=i - 1-query(to[b[i]]);
		}
		add(to[a[i]],1);
	}
	cout<<ans<<endl;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);

	int T=1;
	cin>>T;
	while(T--)
	{
		solve();
	}
	return 0;
}