#include <bits/stdc++.h>
using namespace std;
const int Maxn = 100 + 5, Mod = 1e9 + 7;
int t, n, ai, ps[Maxn], l, r;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 1; i <= n; i++) {
      cin >> ai;
      ps[i] = ps[i - 1] + ai;
    }
    bool ok = 0;
    for (int i = 1; i <= n; i++) {
      for (int j = i; j <= n; j++) {
        if ((ps[j] - ps[i - 1]) % 2 == 0) {
          ok = 1;
          l = i, r = j;
        }
      }
    }
    if (ok) {
      cout << (r - l + 1) << '\n';
      for (int i = l; i <= r; i++) {
        cout << i << ' ';
      }
      cout << '\n';
    } else
      cout << "-1\n";
  }
  return 0;
}
