#include<bits/stdc++.h> using namespace std; const int N=100000; int T,n,a[N],m,f[N],minn; bool cmp(int b,int c){ return b<c; } int main(){ cin>>T; for(int t=1;t<=T;t++){ memset(f,0,sizeof(f)); f[0]=1; m=0; cin>>n; minn=0; for(int i=1;i<=n;i++)cin>>a[i],f[a[i]]=2,m=max(m,a[i]); sort(a+1,a+1+n,cmp); for(int i=1;i<=n;i++){ for(int j=a[i]+1;j<=m;j++){ if(f[j-a[i]]>0)f[j]=1; } } for(int i=1;i<=m;i++)if(f[i]==2)minn++; cout<<minn<<endl; } }