#include <bits/stdc++.h>
using namespace std;
const int blk = 500;
void solve() {
    int n;
    cin >> n;
    vector<int> a(n + 1);
    vector<long long> sum(n + 1, 0);
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        sum[i] = sum[i - 1] + a[i];
    }
    long long ans = 0;
    for (int i = 1; i <= min(blk, n); ++i) {
        for (int j = i; j <= n; ++j) {
            if (sum[j] - sum[j - i] == 1ll * i * i) ans++;
        }
    }
    for (int i = max(n / 2 - blk, min(blk, n)); i <= min(n, n / 2 + blk); i++) {
        for (int j = i; j <= n; ++j) {
            if (sum[j] - sum[j - i] == 1ll * i * i) ans++;
        }
    }
    cout << ans << '\n';
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
}