#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
inline int power(int a, int b) {
    int x = 1;
    while (b) {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

//_ ***************************** START Below *******************************




//? Good Subarrays Hashing

//* We need to find subarrays : (P[R] - P[L-1]) == R - (L-1)
//*                             P[R] - R == P[L-1] - (L-1)
//*     Hence find P[R]-R in past map of P[i]-i




vector<int> a;
void consistency(int n) {
	
	unordered_map<int,int> mp = {{1, 1}};
	int sum = 0;
	int ans = 0;
	
	for(int i=0; i<n; i++){
		sum += a[i];
		
		if(mp.count(sum-i)){
			ans += mp[sum-i];
		}
		mp[sum-i]++;
	}

	
	cout << ans << endl;

}

void solve() {
    
	int n;
	cin >> n;
	a.resize(n);
	for(int i=0; i<n; i++) cin >> a[i];
    consistency(n) ;

}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}