Codeforces Round #846 (Div. 2)-2023/01/25

A. Hayato and School

Today Hayato came home from school with homework.

In the assignment, Hayato was given an array a of length n. The task was to find 3 numbers in this array whose sum is odd. At school, he claimed that there are such 3 numbers, but Hayato was not sure, so he asked you for help.

Answer if there are such three numbers, and if so, output indices i, j, and k such that ai+aj+ak is odd.

The odd numbers are integers that are not divisible by 2: 1, 3, 5, and so on.

Input

The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.

For each test case, the first line contains one integer n (3≤n≤300) — the length of a.

The second line contains n integers a1,a2,…,an (1≤ai≤10^5) — the array a.

It is guaranteed that the sum of n over all test cases does not exceed 2⋅10^5.

Output

For each test case, in the first line print o