write a go solution for Description:
You are given a sequence a of length n consisting of 0s and 1s.

You can perform the following operation on this sequence:

- Pick an index i from 1 to n-2 (inclusive).
- Change all of a_i, a_i+1, a_i+2 to a_ioplusa_i+1oplusa_i+2 simultaneously, where oplus denotes the bitwise XOR operation

We can prove that if there exists a sequence of operations of any length that changes all elements of a to 0s, then there is also such a sequence of length not greater than n.

Input Format:
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*10^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*10^5.

Output Format:
For each test case, do the following:

- if there is no way of making all the elements of a equal to 0 after performing the above operation some number of times, print "NO".
- otherwise, in the first line print "YES", in the second line print k (0<=k<=n) — the number of operations that you want to perform on a, and in the third line print a sequence b_1,b_2,...,b_k (1<=b_i<=n-2) — the indices on which the operation should be applied.

If there are multiple solutions, you may print any.

Note:
In the first example, the sequence contains only 0s 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].. Output only the code with no comments, explanation, or additional text.