#include<cstdio>

#include<cstdlib>

#include<iostream>

#include<fstream>

#include<algorithm>

#include<cstring>

#include<string>

#include<cmath>

#include<queue>

#include<stack>

#include<map>

#include<utility>

#include<set>

#include<bitset>

#include<vector>

#include<functional>

#include<deque>

#include<cctype>

#include<climits>

#include<complex>

//#include<bits/stdc++.h>适用于CF,UOJ，但不适用于poj

using namespace std;

typedef long long LL;

typedef double DB;

typedef pair<int,int> PII;

typedef complex<DB> CP;

#define mmst(a,v) memset(a,v,sizeof(a))

#define mmcy(a,b) memcpy(a,b,sizeof(a))

#define re(i,a,b)  for(i=a;i<=b;i++)

#define red(i,a,b) for(i=a;i>=b;i--)

#define fi first

#define se second

#define m_p(a,b) make_pair(a,b)

#define SF scanf

#define PF printf

#define two(k) (1<<(k))

template<class T>inline T sqr(T x){return x*x;}

template<class T>inline void upmin(T &t,T tmp){if(t>tmp)t=tmp;}

template<class T>inline void upmax(T &t,T tmp){if(t<tmp)t=tmp;}

const DB EPS=1e-;

inline int sgn(DB x){if(abs(x)<EPS)return ;return(x>)?:-;}

const DB Pi=acos(-1.0);

inline int gint()

  {

        int res=;bool neg=;char z;

        for(z=getchar();z!=EOF && z!='-' && !isdigit(z);z=getchar());

        if(z==EOF)return ;

        if(z=='-'){neg=;z=getchar();}

        for(;z!=EOF && isdigit(z);res=res*+z-'',z=getchar());

        return (neg)?-res:res;

    }

inline LL gll()

  {

      LL res=;bool neg=;char z;

        for(z=getchar();z!=EOF && z!='-' && !isdigit(z);z=getchar());

        if(z==EOF)return ;

        if(z=='-'){neg=;z=getchar();}

        for(;z!=EOF && isdigit(z);res=res*+z-'',z=getchar());

        return (neg)?-res:res;

    }

const int maxN=;

int N;

int SG[maxN+];

int a[maxN+];

int tol,bak[maxN*maxN+];

int cnt,ansi,ansj,ansk;

inline int check()//返回1表示为必败态

  {

      int res=,i;

      re(i,,N)if(a[i]%==) res^=SG[i];

      return res==;

  }

int main()

  {

      freopen("game.in","r",stdin);

      freopen("game.out","w",stdout);

      int i,j,k;

      for(int Case=gint();Case;Case--)

        {

            N=gint();

            re(i,,N)a[i]=gint();

            SG[N]=;

            red(i,N-,)

              {

                  tol=;

                        re(j,i+,N)re(k,j,N)bak[++tol]=SG[j]^SG[k];

                  sort(bak+,bak+tol+);

                  tol=unique(bak+,bak+tol+)-bak-;

                  SG[i]=-;

                  re(j,,tol)if(bak[j]!=j-){SG[i]=j-;break;}

                  if(SG[i]==-)SG[i]=tol;

              }

            cnt=;

            re(i,,N)if(a[i]>=)re(j,i+,N)re(k,j,N)

              {

                  a[i]--;a[j]++;a[k]++;

                  if(check()){cnt++;if(cnt==){ansi=i;ansj=j;ansk=k;}}

                        a[i]++;a[j]--;a[k]--;

                    }

                if(cnt==)PF("-1 -1 -1\n0\n"); else PF("%d %d %d\n%d\n",ansi-,ansj-,ansk-,cnt);

        }

      return ;

  }