#include #include #include int compare_int(const void *a, const void *b); int compare_int(const void *a, const void *b) { return *(int*)b - *(int*)a; } int main() { int T, N; int A[2*100000]; bool flg, dng; scanf( "%d\n", &T ); for( int t; t < T; t++ ) { scanf( "%d\n", &N ); for( int a = 0; a < N -1; a++ ) { scanf( "%d ", A+a ); } scanf( "%d\n", A+N-1 ); qsort( A, N, sizeof(int), compare_int ); flg = false; while( 1 ) { int f, s, t; flg = true; dng = false; f = 0; s = 0; t = 0; while( 1 ) { dng = false; if( f >= N ) { flg = false ; break; } if( A[f] == 0 ) { f++; continue; } A[f]--; s = f+1; while( 1 ) { if( s >= N ) { flg = false; break; } if( A[s] == 0 ) { s++; continue; } A[s]--; break; } if( flg == false ) { break; } t = s+1; while( 1 ) { if( t >= N ) { flg = false; break; } if( A[t] == 0 ) { t++; continue; } A[t]--; flg = true; dng = true; break;; } if( dng == true ) { break; } } if( flg == true ) { printf("Yes\n"); break; } else { printf("No\n"); break; } } } return 0; }