#include <bits/stdc++.h>
using namespace std;

const int NUM = 1000;

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    vector<long long> psum(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        psum[i] = (i > 0 ? psum[i - 1] : 0) + a[i];
    }

    set<int> lens;
    for (int i = 1; i < min(NUM, n); i++) {
        lens.insert(i);
    }
    for (int i = max(n / 2 - NUM, 1); i < min(n / 2 + NUM, n); i++) {
        lens.insert(i);
    }

    int cnt = 0;
    for (int len : lens) {
        for (int i = 0; i < n - len + 1; i++) {
            long long cur_sum = psum[i + len - 1] - (i > 0 ? psum[i - 1] : 0);
            if (cur_sum == (long long) len * len) {
                cnt++;
            }
        }
    }
    cout << cnt << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

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