#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)

using namespace std;
using ll = long long;

const int N = 2e5 + 10;
ll a[N];

signed main() {
    int T;
    cin >> T;
    while(T --) {
        int n;
        cin >> n;
        rep(i,1,n) cin >> a[i];
        rep(i,1,n) a[i] += a[i - 1];
        ll cnt = 0;
        rep(l,1,n) rep(r,l,min(l+100,n)) {
            if(a[r] - a[l - 1] == 1ll * (r - l + 1) * (r - l + 1)) {
                ++ cnt;
            }
        }
        cout << cnt << endl;
    }
    return 0;
}