You are given an array a consisting of n positive integers. Find a non-empty subset of its elements such that their sum is even (i.e. divisible by 2) or determine that there is no such subset.

Both the given array and required subset may contain equal values.

Input

The first line contains a single integer t (1 ≤ t ≤ 100), number of test cases to solve. Descriptions of t test cases follow.

A description of each test case consists of two lines. The first line contains a single integer n (1 ≤ n ≤ 100), length of array a.

The second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 100), elements of a. The given array a can contain equal values (duplicates).

Output

For each test case output -1 if there is no such subset of elements. Otherwise output positive integer k, number of elements in the required subset. Then output k distinct integers (1 ≤ p_i ≤ n), indexes of the chosen elements. If there are multiple solutions output any of them.

Example

Input


3
3
1 4 3
1
15
2
3 5


Output


1
2
-1
2
1 2

Note

There are three test cases in the example.

In the first test case, you can choose the subset consisting of only the second element. Its sum is 4 and it is even.

In the second test case, there is only one non-empty subset of elements consisting of the first element, however sum in it is odd, so there is no solution.

In the third test case, the subset consisting of all array's elements has even sum.
/* package whatever; // don't place package name! */
 
import java.util.*;
import java.math.BigInteger; 
import java.lang.*;
import java.io.*;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.lang.Math; 
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
 
/* Name of the class has to be "Main" only if the class is public. */
public class bbg
{
	public static int result;
 
public static ArrayList<Integer> [] graph;
 
public static int[]cats;
 public static String[]vector;
 
 
public static int vizitat[];
public static int x;
//public static HashMap<String, Integer> map2;
 
 
	public static void main (String[] args) throws IOException {
 
Scanner input = new Scanner(System.in);
 
HashMap<Integer, Integer> contor1= new HashMap<Integer, Integer>();
HashMap<Integer, Integer> contor2= new HashMap<Integer, Integer>();
 
 
HashMap<Integer, Integer> map= new HashMap<Integer, Integer>();
HashMap<String, Integer> litere= new HashMap<String, Integer>();
HashMap<String, Integer> combinari= new HashMap<String, Integer>();
 
 
 //litere.put("a",1);
// litere.put("e",1);
//litere.put("i",1);
//litere.put("o",1);
 
//litere.put("u",1);
 BigInteger numar_initial; 
 BigInteger primul; 
 BigInteger doilea;
  BigInteger produs;
  BigInteger unitatea;
  

   int min,max;
  max=0;
   int contor=0;
   int mutari=0;
  int rez=0;
 
int teste=input.nextInt();
for (int t=1; t<=teste;t++)
{int y=0;

 int impar1=-1;
 int impar2=-1;
  int par=-1;
   int impar=-1;
 int rasp=-1;
 int n=input.nextInt();
 
 int vec[]=new int[n];
 
 for (int i=0;i<n;i++) {vec[i]=input.nextInt();
 

 if(vec[i] % 2 ==0 && y==0) {y=1;par=i+1; rasp=vec[i]; System.out.println(1);
  System.out.println(i+1);
 }
 

 
 if(i>0 && vec[i]%2==1 && vec[i-1] % 2 ==1 && y==0) {System.out.println(2);
 int zz=i+1;
 System.out.println(i +" "+ zz);
 
 y=1;
 

 
 




}


 
}


if(y==0) System.out.println(-1);

}
  
}

}
