## Xor of 3 solution codeforces

You are given a sequence aa of length nn consisting of 00s and 11s.

You can perform the following operation on this sequence:

- Pick an index ii from 11 to n−2n−2 (inclusive).
- Change all of aiai, ai+1ai+1, ai+2ai+2 to ai⊕ai+1⊕ai+2ai⊕ai+1⊕ai+2 simultaneously, where ⊕⊕ denotes the bitwise XOR operation

Find a sequence of at most nn operations that changes all elements of aa to 00s or report that it’s impossible.We can prove that if there exists a sequence of operations of any length that changes all elements of aa to 00s, then there is also such a sequence of length not greater than nn.

Each test contains multiple test cases. The first line contains the number of test cases tt (1≤t≤1041≤t≤104).

The first line of each test case contains a single integer nn (3≤n≤2⋅1053≤n≤2⋅105) — the length of aa.

The second line of each test case contains nn integers a1,a2,…,ana1,a2,…,an (ai=0ai=0 or ai=1ai=1) — elements of aa.

It is guaranteed that the sum of nn over all test cases does not exceed 2⋅1052⋅105.

For each test case, do the following:

- if there is no way of making all the elements of aa equal to 00 after performing the above operation some number of times, print “NO“.
- otherwise, in the first line print “YES“, in the second line print kk (0≤k≤n0≤k≤n) — the number of operations that you want to perform on aa, and in the third line print a sequence b1,b2,…,bkb1,b2,…,bk (1≤bi≤n−21≤bi≤n−2) — the indices on which the operation should be applied.

If there are multiple solutions, you may print any.

3 3 0 0 0 5 1 1 1 1 0 4 1 0 0 1

YES 0 YES 2 3 1 NO

In the first example, the sequence contains only 00s so we don’t need to change anything.

In the second example, we can transform [1,1,1,1,0][1,1,1,1,0] to [1,1,0,0,0][1,1,0,0,0] and then to [0,0,0,0,0][0,0,0,0,0] by performing the operation on the third element of aa and then on the first element of aa.

In the third example, no matter whether we first perform the operation on the first or on the second element of aa we will get [1,1,1,1][1,1,1,1], which cannot be transformed to [0,0,0,0][0,0,0,0].

Also read : Airline Restrictions codechef solution