#include <bits/stdc++.h>
using namespace std;
void subset(int* a,int n,int i,int &count,int sum=0){
//base case
if(i==n){
if(sum==0){
count++;
}
return;
}
//recursive case
sum=sum+a[i];
subset(a,n,i+1,count,sum+a[i]);
subset(a,n,i+1,count,sum);
}
int main()
{
int testCases;
cin >> testCases;
while (testCases–)
{
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
int count=0;
subset(v,n,0,count,0);
if(count>0){
cout<<“Yes”;
}else {
cout<<“No”;
}
}
}