B"You are given a sequence a of length n consisting of 0 s and 1 s. You can perform the following operation on this sequence: We can prove that if there exists a sequence of operations of any length that changes all elements of a to 0 s, then there is also such a sequence of length not greater than n . Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^4 ). The first line of each test case contains a single integer n ( 3 <= n <= 2 cdot10^5 ) -- the length of a . The second line of each test case contains n integers a_1, a_2, ldots, a_n ( a_i = 0 or a_i = 1 ) -- elements of a . It is guaranteed that the sum of n over all test cases does not exceed 2 cdot10^5 . For each test case, do the following: If there are multiple solutions, you may print any. In the first example, the sequence contains only 0 s so we don't need to change anything. In the second example, we can transform [1, 1, 1, 1, 0] to [1, 1, 0, 0, 0] and then to [0, 0, 0, 0, 0] by performing the operation on the third element of a and then on the first element of a . In the third example, no matter whether we first perform the operation on the first or on the second element of a we will get [1, 1, 1, 1] , which cannot be transformed to [0, 0, 0, 0] . "...