#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 3;
int T;
int n, num;
typedef long long ll;

void work(){
	cin >> n;
	vector <ll> a(n + 1),sum(n + 1);
	for(int i = 1;i <= n;i++) {
		cin >> a[i];
		sum[i] = a[i];
		sum[i] += sum[i - 1];
	}
	auto calc = [&] (ll now) {
		ll x = sqrt(now);
		if(x * x != now) x++;
		return x;
	};
	ll ans = 0;
	for(int i = 1;i <= n;i++) {
		ll len = 0;
		while(true) {
			len = max(len + 1,calc(sum[i] - sum[i - len]));
			if(len > i) break;
//			cout << i << ' ' << len << ' ' << sum[i] << '\n';
			if(sum[i] - sum[i - len] == len * len) ans++;
		}
	}
	cout << ans << '\n';
}


int main(){
//	freopen("test.txt", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> T;
	while(T--){
		work();
	}	
	return 0;
}