#include <cstdio>#include <cstdlib>#include <iostream>#include <string.h>#include <queue>#include <limits.h>#include <algorithm>using namespace std;int cmp(int a,int b){return a > b;}int len[30],n,vis[30],l,num,flag;int check(){int i;for(i=0; i<n; i++)if( !vis[i] )return 0;return 1;}void DFS(int x,int sum,int cur){int i;if( flag != 0 )return ;if( sum == l ){num++;if( num == 4 && check() ){flag = 1;return ;}while( vis[cur] ) cur++; DFS(cur,0,cur);if( flag != 1 ){flag = 0;return ;}return ;}for(i=x; i<n; i++){if( !vis[i] && sum + len[i] <= l ){vis[i] = 1;DFS(i+1,sum+len[i],cur);if( flag )return ;if( sum + len[i] == l )num--;vis[i] = 0;while( len[i] == len[i+1] )i++;}if( !vis[cur] ) {flag = -1;return ;}}}int main(){int ncases;int i,sum;scanf("%d",&ncases);while( ncases-- ){scanf("%d",&n);sum = 0;for(i=0; i<n; i++){scanf("%d",&len[i]);sum += len[i];}if( sum % 4 != 0 ){printf("non");continue;}sort(len,len+n,cmp);l = sum/4;memset(vis,0,sizeof(vis));flag = num = 0;DFS(0,0,0);if( flag == 1 )printf("yesn");elseprintf("non");}return 0;}
