#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int N = 2e5 + 5;
constexpr int B = 500;
int n, a[N];
ll sum[N];
bool vis[N];
inline void work(int T)
{
	cin >> n;
	if (T == 30)
		cout << n << '\n';
	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i];
		sum[i] = sum[i - 1] + a[i];
	}
	int k = n / 2;
	int res = 0;
	for (int i = 1; i <= n; ++i)
	{
		for (int j = 1; j <= min(B, max(k - B, 1) - 1); ++j)
			if (sum[i] - sum[i - j] == (ll)j * j)
			{
				++res;
			}
		for (int j = max(k - B, 1); j <= min(k + B, i); ++j)
			if (sum[i] - sum[i - j] == (ll)j * j)
			{
				++res;
			}
	}
	cout << res << '\n';
}
signed main()
{
//	freopen("project.in", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int T;
	cin >> T;
	while (T--)
		work(T);
	return 0;
}