rt

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int a[35];
int dp[1005];
int solve(){
	int n;
	cin >> n;
	int sum = 0;
	for (int i = 1;i <= n;i++){
		cin >> a[i];
		sum += a[i];
	}
	sort(a + 1,a + n + 1);
	memset(dp,0,sizeof dp);
	dp[0] = 1;
	for (int i = 1;i <= n;i++){
		for (int j = sum;j >= a[i];j--){
			dp[j] += dp[j - a[i]];
		}
	}
	int ans = 0;
	for (int i = 1;i <= n;i++){
		ans += dp[a[i]];
	}
	cout << ans - n << endl;
	return 0;
}
int main(){
	int t;
	cin >> t;
	while (t--) solve();
	return 0;
}