You are given an array (a) consisting of the numbers (1), (2), and (3). Check whether it is possible to split it into three contiguous non-empty parts such that, for each part (i) from (1) to (3), the following condition holds: the number of elements greater than (i) is at most half of the part. In other words, you need to divide the array (a) into three pairwise disjoint contiguous non-empty parts so that in the left part the number of ones is at least the total number of twos and threes, in the middle part the total number of ones and twos is at least the number of threes, and the right part can be anything, but it must be non-empty. For example, the array (2, 1, 1, 3, 3, 1, 2, 3) can be split into three parts: (2, 1, 1, 3), (3, 1, 2), and (3). And the array (2, 1, 3, 3, 3, 2, 3) cannot be split in such a way. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains an integer (n) ((3 \le n \le 2 \cdot 10^{5})) — the length of the array. The second line of each test case contains (n) integers (a_{i}) ((1 \le a_{i} \le 3)). Additional constraints on the input data: the sum of (n) over all test cases does not exceed (2 \cdot 10^{5}). For each test case, print YES if there exists a way to split the array as required, and NO otherwise. You may print the answer in any case. For example, YeS , YES , NO , nO will also be accepted. The first two test cases are explained in the statement. In the third test case, the left part may be (1), but then any choice of the middle part ((3), (3, 3), (3, 3, 2)) does not work. The left part may also be (1, 3); then the middle part must be (3, 2), and in this case the right part is empty. Therefore, the answer for the third example is NO . In the fou