// C++ program to find count of subarrays with
// sum divisible by k.
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int subCount(ll arr[], ll n,ll k)
{
int mod[k];
memset(mod, 0, sizeof(mod));
int cumSum = 0;
for (int i = 0; i < n; i++) {
cumSum += arr[i];
mod[((cumSum % k) + k) % k]++;
}
int result = 0;
for (int i = 0; i < k; i++)
if (mod[i] > 1)
result += (mod[i] * (mod[i] - 1)) / 2;
result += mod[0];
return result;
}
int main()
{
ll t;
cin>> t;
while(t–)
{
ll n;
cin>> n;
if(n==1)
{
cout<<1<<endl;
}
else{
ll arr1[n];
for(int i=0;i<n;i++)
{
cin>> arr1[i];
}
cout << subCount(arr1, n,n) << endl;
}
}
return 0;
}
