B"You are given a sequence [a_1, ldots,a_n] where each element a_i is either 0 or 1 . You can apply several (possibly zero) operations to the sequence. In each operation, you select two integers 1 <= l <= r <= |a| (where |a| is the current length of a ) and replace [a_l, ldots,a_r] with a single element x , where x is the majority of [a_l, ldots,a_r] . Here, the majority of a sequence consisting of 0 and 1 is defined as follows: suppose there are c_0 zeros and c_1 ones in the sequence, respectively. For example, suppose a=[1,0,0,0,1,1] . If we select l=1,r=2 , the resulting sequence will be [0,0,0,1,1] . If we select l=4,r=6 , the resulting sequence will be [1,0,0,1] . Determine if you can make a=[1] with a finite number of operations. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 4 cdot 10^4 ). Description of the test cases follows. The first line of each testcase contains one integer n ( 1 <= n <= 2 cdot 10^5 ). The second line of each testcase contains a string consisting of 0 and 1 , describing the sequence a . It's guaranteed that the sum of n over all testcases does not exceed 2 cdot 10^5 . For each testcase, if it's possible to make a=[1] , print YES. Otherwise, print NO. You can output the answer in any case (upper or lower). For example, the strings yEs, yes, Yes, and YES will be recognized as positive responses. In the fourth testcase of the example, initially a=[1,0,0,0,0,0,0,0,1] . A valid sequence of operations is: "...