#include <bits/stdc++.h>

using namespace std;

using ll = long long;

constexpr int LOV66 = 2000;

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    vector<ll> pref(n + 1);
    pref[0] = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        pref[i + 1] = pref[i] + a[i];
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        int j = i;
        while (j >= 0) {
            ll sm = pref[i + 1] - pref[j];
            if (sm == 1ll * (i - j + 1) * (i - j + 1)) {
                ans++;
                j--;
            } else if (sm < 1ll * (i - j + 1) * (i - j + 1)) {
                j--;
            } else {
                j = i - (int)(sqrt(sm - 1));
            }
        }
    }
    cout << ans << '\n';
} 

int32_t main() {
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}