You are given numbers a_1, a_2, \ldots, a_n. Can you split them into two nonempty groups, so that XOR of the numbers in the first group is larger than AND of the numbers in the second group?
The first line contains a single integer (1 \le t \le 10^5) — the number of test cases. The description of test cases follows.
The first line of each test case contains a single integer (2 \leq n \leq 2\cdot 10^5) — the number of numbers.
The second line of each test case contains integers a_1, a_2, \ldots, a_n (1 \le a_i < 2^{30}).
It is guaranteed that the sum of over all test cases does not exceed 2 \cdot 10^5.
For each test case, if there is no such way to split, print NO.
Otherwise, print YES. On the next line output a single integer (1 \leq k \leq n-1) — the size of the first group.
On the next line, output integers pos_1, pos_2, \ldots, pos_k (1 \le pos_i \le n, all pos_i are distinct) — the positions of elements that you are going to put to the first group.
You can print YES and NO in any case (e.g. the strings yEs, yes, Yes will be taken as a positive answer).
Example
In the first test case, we can put number in the first group, and number in the second group. The XOR of the numbers in the first group is , and AND of the numbers in the second group is .
In the second test case, there is no such way to split the numbers.
In the third test case, we can put numbers in the first group, and numbers in the second group. The XOR of the numbers in the first group is XOR XOR 12 = 13, and AND of the numbers in the second group is AND 9 = 8.