#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")

#define int long long
#define pb push_back
#define all(s) s.begin(),s.end()
#define pii pair<int,int>
#define fr first
#define sc second
#define bst ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"

using namespace std;

const int N = 5e5 + 10, mod = 1e9 + 7, inf = 1e18 + 7;
const double pi = acos(-1);

map<int, int> mp;

void solve() {
	//soln
	int n;
	cin >> n;
	set<int> s;
	int v[n];
	for(int i = 0; i < n; i++) {
  	cin >> v[i];
  	mp[v[i]]++;
  	s.insert(v[i]);
  }
  set<int> del;
  int ans = 0;
  for(int i = 0; i < n; i++) {
  	int sum = v[i];
  	for(int j = i + 1; j < n; j++) {
			sum += v[j];
			if(s.find(sum) != s.end() && del.find(sum) == del.end()) {
				ans += mp[sum];
				del.insert(sum);
			}
  	}
  }
  cout << ans << endl;
  mp.clear();
}
main() {
	bst;
	int t = 1;
	cin >> t;
	while(t--) {
		solve();
	}
}