#include <iostream>
#include <stdio.h>
#include <set>
#include <string>
#include <queue>

using namespace std;

int main()
{
	ios::sync_with_stdio(false);
	int w, h, n;
	cin >> w >> h >> n;
	set<int> qh, qv;
	multiset<int> mh, mv;
	qh.insert(h);
	qh.insert(0);
	qv.insert(w);
	qv.insert(0);
	mh.insert(h);
	mv.insert(w);
	char s[5];
	for (int i = 0; i < n; i++)
	{
		cin >> s;
		getchar();
		multiset<int> ::iterator iter, pre, next;
		multiset<int> ::iterator era;
		if (s[0] == 'H')
		{
			int y;
			cin >> y;
			qh.insert(y);
			pre = next = iter = qh.find(y);
			pre--;
			next++;
			era = mh.find(*next - *pre);
			mh.erase(era);
			mh.insert(y - *pre);
			mh.insert(*next - y);
		}
		else if (s[0] == 'V')
		{
			int x;
			cin >> x;
			qv.insert(x);
			pre = next = iter = qv.find(x);
			pre--;
			next++;
			era = mv.find(*next - *pre);
			mv.erase(era);
			mv.insert(x - *pre);
			mv.insert(*next - x);
		}
		multiset<int> ::iterator iterh, iterv;
		iterh = mh.end();
		iterh--;
		iterv = mv.end();
		iterv--;
		long long ans = (long long)(*iterh) * (*iterv);
		cout << ans << endl;
	}
	return 0;
}


#include <iostream>
#include <stdio.h>
#include <set>
#include <string>
#include <queue>

using namespace std;

int main()
{
	ios::sync_with_stdio(false);
	int w, h, n;
	cin >> w >> h >> n;
	set<int> qh, qv;
	multiset<int> mh, mv;
	qh.insert(h);
	qh.insert(0);
	qv.insert(w);
	qv.insert(0);
	mh.insert(h);
	mv.insert(w);
	char s[5];
	for (int i = 0; i < n; i++)
	{
		cin >> s;
		getchar();
		multiset<int> ::iterator iter, pre, next;
		multiset<int> ::iterator era;
		if (s[0] == 'H')
		{
			int y;
			cin >> y;
			qh.insert(y);
			pre = next = iter = qh.find(y);
			pre--;
			next++;
			era = mh.find(*next - *pre);
			mh.erase(era);
			mh.insert(y - *pre);
			mh.insert(*next - y);
		}
		else if (s[0] == 'V')
		{
			int x;
			cin >> x;
			qv.insert(x);
			pre = next = iter = qv.find(x);
			pre--;
			next++;
			era = mv.find(*next - *pre);
			mv.erase(era);
			mv.insert(x - *pre);
			mv.insert(*next - x);
		}
		multiset<int> ::iterator iterh, iterv;
		iterh = mh.end();
		iterh--;
		iterv = mv.end();
		iterv--;
		long long ans = (long long)(*iterh) * (*iterv);
		printf("%I64d\n", ans);
	}
	return 0;
}


#include <iostream>
#include <stdio.h>
#include <set>
#include <string>
#include <queue>

using namespace std;

int main()
{
    int w, h, n;
    cin>>w>>h>>n;
    set<int> qh, qv;
    multiset<int> mh, mv;
    qh.insert(h);
    qh.insert(0);
    qv.insert(w);
    qv.insert(0);
    mh.insert(h);
    mv.insert(w);
    char s[5];
    for(int i = 0; i < n; i++)
    {
        scanf("%s", s);
        set<int> ::iterator iter, pre, next;
        multiset<int> ::iterator era;
        if(s[0] == 'H')
        {
            int y;
            cin>>y;
            qh.insert(y);
            pre = next = iter = qh.find(y);
            pre--;
            next++;
            era = mh.find(*next - *pre);
            mh.erase(era);
            mh.insert(y - *pre);
            mh.insert(*next - y);
        }
        else if(s[0] == 'V')
        {
            int x;
            cin>>x;
            qv.insert(x);
            pre = next = iter = qv.find(x);
            pre--;
            next++;
            era = mv.find(*next - *pre);
            mv.erase(era);
            mv.insert(x - *pre);
            mv.insert(*next - x);
        }
        multiset<int> ::iterator iterh, iterv;
        iterh = mh.end();
        iterh--;
        iterv = mv.end();
        iterv--;
        long long ans = (long long)(*iterh) * (*iterv);
        printf("%I64d\n", ans);
    }
    return 0;
}


#include <iostream>
#include <stdio.h>
#include <set>
#include <string>
#include <queue>

using namespace std;

int main()
{
	int w, h, n;
	cin >> w >> h >> n;
	multiset<int> qh, qv;
	multiset<int> mh, mv;
	qh.insert(h);
	qh.insert(0);
	qv.insert(w);
	qv.insert(0);
	mh.insert(h);
	mv.insert(w);
	char s[5];
	for (int i = 0; i < n; i++)
	{
		cin >> s;
		multiset<int> ::iterator iter, pre, next;
		multiset<int> ::iterator era;
		if (s[0] == 'H')
		{
			int y;
			cin >> y;
			getchar();
			qh.insert(y);
			pre = next = iter = qh.find(y);
			pre--;
			next++;
			era = mh.find(*next - *pre);
			mh.erase(era);
			mh.insert(y - *pre);
			mh.insert(*next - y);
		}
		else if (s[0] == 'V')
		{
			int x;
			cin >> x;
			getchar();
			qv.insert(x);
			pre = next = iter = qv.find(x);
			pre--;
			next++;
			era = mv.find(*next - *pre);
			mv.erase(era);
			mv.insert(x - *pre);
			mv.insert(*next - x);
		}
		multiset<int> ::iterator iterh, iterv;
		iterh = mh.end();
		iterh--;
		iterv = mv.end();
		iterv--;
		long long ans = (long long)(*iterh) * (*iterv);
		cout << ans << endl;
	}
	return 0;
}


#include <iostream>
#include <stdio.h>
#include <set>
#include <string>
#include <queue>

using namespace std;

int main()
{
	int w, h, n;
	cin >> w >> h >> n;
	multiset<int> qh, qv;
	multiset<int> mh, mv;
	qh.insert(h);
	qh.insert(0);
	qv.insert(w);
	qv.insert(0);
	mh.insert(h);
	mv.insert(w);
	char s[5];
	for (int i = 0; i < n; i++)
	{
		scanf("%s", s);
		multiset<int> ::iterator iter, pre, next;
		multiset<int> ::iterator era;
		if (s[0] == 'H')
		{
			int y;
			cin >> y;
			qh.insert(y);
			pre = next = iter = qh.find(y);
			pre--;
			next++;
			era = mh.find(*next - *pre);
			mh.erase(era);
			mh.insert(y - *pre);
			mh.insert(*next - y);
		}
		else if (s[0] == 'V')
		{
			int x;
			cin >> x;
			qv.insert(x);
			pre = next = iter = qv.find(x);
			pre--;
			next++;
			era = mv.find(*next - *pre);
			mv.erase(era);
			mv.insert(x - *pre);
			mv.insert(*next - x);
		}
		multiset<int> ::iterator iterh, iterv;
		iterh = mh.end();
		iterh--;
		iterv = mv.end();
		iterv--;
		long long ans = (long long)(*iterh) * (*iterv);
		printf("%I64d\n", ans);
	}
	return 0;
}


#include<iostream>
#include<cstring>
#include<set>
using namespace std;
typedef long long ll;
int main() {
	ios::sync_with_stdio(false);
	int i, j, k, ih, iv;
	int w, h, n, len, lger, ster;
	char hv[10] = { '0' };
	multiset<int> dv, dh;
	multiset<int> Hi, Vi;
	multiset<int>::iterator it, pre, next;
	ll ans;
	while (cin >> w >> h >> n) {
		Hi.clear(), Vi.clear();
		dh.clear(), dv.clear();
		Hi.insert(0), Hi.insert(h);
		Vi.insert(0), Vi.insert(w);
		dh.insert(h), dv.insert(w);
		while (n--) {
			cin >> hv;
			if (hv[0] == 'H') {
				cin >> len;
				Hi.insert(len);
				pre = next = Hi.find(len);
				pre--, next++;
				lger = *next;
				ster = *pre;
				it = dh.find(lger - ster);
				dh.erase(it);
				dh.insert(lger - len);
				dh.insert(len - ster);
				//printf("%d\n", ih*iv);
			}
			else if (hv[0] == 'V') {
				cin >> len;
				Vi.insert(len);
				pre = next = Vi.find(len);
				pre--, next++;
				lger = *next;
				ster = *pre;
				it = dv.find(lger - ster);
				dv.erase(it);
				dv.insert(lger - len);
				dv.insert(len - ster);
			}
			it = dh.end(), it--;
			ih = *it;
			it = dv.end(), it--;
			iv = *it;
			ans = (ll)(iv*ih);
			cout << ans << endl;
		}
	}
	return 0;
}


#include<iostream>
#include<cstring>
#include<set>
using namespace std;
typedef long long ll;
int main() {
	ios::sync_with_stdio(false);
	int i, j, k, ih, iv;
	int w, h, n, len, lger, ster;
	char hv[10] = { '0' };
	multiset<int> dv, dh;
	multiset<int> Hi, Vi;
	multiset<int>::iterator it, pre, next;
	ll ans;
	while (cin >> w >> h >> n) {
		Hi.clear(), Vi.clear();
		dh.clear(), dv.clear();
		Hi.insert(0), Hi.insert(h);
		Vi.insert(0), Vi.insert(w);
		dh.insert(h), dv.insert(w);
		while (n--) {
			cin >> hv;
			if (hv[0] == 'H') {
				cin >> len;
				Hi.insert(len);
				pre = next = Hi.find(len);
				pre--, next++;
				lger = *next;
				ster = *pre;
				it = dh.find(lger - ster);
				dh.erase(it);
				dh.insert(lger - len);
				dh.insert(len - ster);
				//printf("%d\n", ih*iv);
			}
			else if (hv[0] == 'V') {
				cin >> len;
				Vi.insert(len);
				pre = next = Vi.find(len);
				pre--, next++;
				lger = *next;
				ster = *pre;
				it = dv.find(lger - ster);
				dv.erase(it);
				dv.insert(lger - len);
				dv.insert(len - ster);
			}
			it = dh.end(), it--;
			ih = *it;
			it = dv.end(), it--;
			iv = *it;
			ans = (ll)((ll)iv*(ll)ih);
			cout << ans << endl;
		}
	}
	return 0;
}


#include <iostream>
#include <stdio.h>
#include <set>
#include <string>
#include <queue>

using namespace std;

int main()
{
	int w, h, n;
	cin >> w >> h >> n;
	set<int> qh, qv;
	multiset<int> mh, mv;
	qh.insert(h);
	qh.insert(0);
	qv.insert(w);
	qv.insert(0);
	mh.insert(h);
	mv.insert(w);
	char s[5];
	for (int i = 0; i < n; i++)
	{
		scanf("%s", s);
		set<int> ::iterator iter, pre, next;
		multiset<int> ::iterator era;
		if (s[0] == 'H')
		{
			int y;
			cin >> y;
			qh.insert(y);
			pre = next = iter = qh.find(y);
			pre--;
			next++;
			era = mh.find(*next - *pre);
			mh.erase(era);
			mh.insert(y - *pre);
			mh.insert(*next - y);
		}
		else if (s[0] == 'V')
		{
			int x;
			cin >> x;
			qv.insert(x);
			pre = next = iter = qv.find(x);
			pre--;
			next++;
			era = mv.find(*next - *pre);
			mv.erase(era);
			mv.insert(x - *pre);
			mv.insert(*next - x);
		}
		multiset<int> ::iterator iterh, iterv;
		iterh = mh.end();
		iterh--;
		iterv = mv.end();
		iterv--;
		long long ans = (long long)(*iterh) * (*iterv);
		printf("%I64d\n", ans);
	}
	return 0;
}


#include <iostream>
#include <stdio.h>
#include <set>
#include <string>
#include <queue>

using namespace std;

int main()
{
	int w, h, n;
	cin >> w >> h >> n;
	multiset<int> qh, qv;
	multiset<int> mh, mv;
	qh.insert(h);
	qh.insert(0);
	qv.insert(w);
	qv.insert(0);
	mh.insert(h);
	mv.insert(w);
	char s[5];
	for (int i = 0; i < n; i++)
	{
		scanf("%s", s);
		multiset<int> ::iterator iter, pre, next;
		multiset<int> ::iterator era;
		if (s[0] == 'H')
		{
			int y;
			cin >> y;
			qh.insert(y);
			pre = next = iter = qh.find(y);
			pre--;
			next++;
			era = mh.find(*next - *pre);
			mh.erase(era);
			mh.insert(y - *pre);
			mh.insert(*next - y);
		}
		else if (s[0] == 'V')
		{
			int x;
			cin >> x;
			qv.insert(x);
			pre = next = iter = qv.find(x);
			pre--;
			next++;
			era = mv.find(*next - *pre);
			mv.erase(era);
			mv.insert(x - *pre);
			mv.insert(*next - x);
		}
		multiset<int> ::iterator iterh, iterv;
		iterh = mh.end();
		iterh--;
		iterv = mv.end();
		iterv--;
		long long ans = (long long)(*iterh) * (*iterv);
		cout << ans << endl;
	}
	return 0;
}


#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll w,h,n,nx,ny;
ll x[300000],y[300000],ans[300000],a[300000];
char ch[300000];
set<ll> stx,sty;
int main()
{
	ll i,j,k;
	ll maxx,maxy;
	cin>>w>>h>>n;
	nx=ny=0;
	x[++nx]=0;
	y[++ny]=0;
	for (i=1;i<=n;i++)
	{
		int p;
		cin>>ch[i];
		cin>>p;
		a[i]=p;
		if (ch[i]=='H')
			x[++nx]=p;
		if (ch[i]=='V')
			y[++ny]=p;
	}
	x[++nx]=h;       //don't forget
	y[++ny]=w;
	sort(x+1,x+nx+1);
	sort(y+1,y+ny+1);
	maxx=-1;
	maxy=-1;
	for (i=1;i<=nx;i++)
		maxx=max(maxx,x[i]-x[i-1]);
	for (i=1;i<=ny;i++)
		maxy=max(maxy,y[i]-y[i-1]);
	for (i=1;i<=nx;i++)
		stx.insert(x[i]);
	for (i=1;i<=ny;i++)
		sty.insert(y[i]);
	set<ll>::iterator l,t,r;
	for (i=n;i;i--)
	{
		ans[i]=(ll)maxx*maxy;
		if (ch[i]=='H')
		{
			l=r=t=stx.lower_bound(a[i]);  //////////这里出bug了！！！
			l--;
			r++;
			stx.erase(t);
			maxx=max(maxx,*r-*l);
		}
		else
		{
			l=r=t=sty.lower_bound(a[i]);
			l--;
			r++;
			sty.erase(t);
			maxy=max(maxy,*r-*l);
		}
	}
	for (i=1;i<=n;i++)
		cout<<ans[i]<<endl;
	return 0;
}


#include<bits/stdc++.h>
#define ll long long
using namespace std;
int w,h,n,nx,ny;
int x[200000],y[200000],ans[200000],a[200000];
char ch[200000];
set<int> stx,sty;
int main()
{
	int i,j,k;
	int maxx,maxy;
	cin>>w>>h>>n;
	nx=ny=0;
	x[++nx]=0;
	y[++ny]=0;
	for (i=1;i<=n;i++)
	{
		int p;
		cin>>ch[i];
		cin>>p;
		a[i]=p;
		if (ch[i]=='H')
			x[++nx]=p;
		if (ch[i]=='V')
			y[++ny]=p;
	}
	x[++nx]=h;       //don't forget
	y[++ny]=w;
	sort(x+1,x+nx+1);
	sort(y+1,y+ny+1);
	maxx=-1;
	maxy=-1;
	for (i=1;i<=nx;i++)
		maxx=max(maxx,x[i]-x[i-1]);
	for (i=1;i<=ny;i++)
		maxy=max(maxy,y[i]-y[i-1]);
	for (i=1;i<=nx;i++)
		stx.insert(x[i]);
	for (i=1;i<=ny;i++)
		sty.insert(y[i]);
	set<int>::iterator l,t,r;
	for (i=n;i;i--)
	{
		ans[i]=(ll)maxx*maxy;
		if (ch[i]=='H')
		{
			l=r=t=stx.lower_bound(a[i]);  //////////这里出bug了！！！
			l--;
			r++;
			stx.erase(t);
			maxx=max(maxx,*r-*l);
		}
		else
		{
			l=r=t=sty.lower_bound(a[i]);
			l--;
			r++;
			sty.erase(t);
			maxy=max(maxy,*r-*l);
		}
	}
	for (i=1;i<=n;i++)
		cout<<ans[i]<<endl;
	return 0;
}


#include<bits/stdc++.h>
#define ll long long
using namespace std;
int w,h,n,nx,ny;
int x[300000],y[300000],ans[300000],a[300000];
char ch[300000];
set<int> stx,sty;
int main()
{
	int i,j,k;
	int maxx,maxy;
	cin>>w>>h>>n;
	nx=ny=0;
	x[++nx]=0;
	y[++ny]=0;
	for (i=1;i<=n;i++)
	{
		int p;
		cin>>ch[i];
		cin>>p;
		a[i]=p;
		if (ch[i]=='H')
			x[++nx]=p;
		if (ch[i]=='V')
			y[++ny]=p;
	}
	x[++nx]=h;       //don't forget
	y[++ny]=w;
	sort(x+1,x+nx+1);
	sort(y+1,y+ny+1);
	maxx=-1;
	maxy=-1;
	for (i=1;i<=nx;i++)
		maxx=max(maxx,x[i]-x[i-1]);
	for (i=1;i<=ny;i++)
		maxy=max(maxy,y[i]-y[i-1]);
	for (i=1;i<=nx;i++)
		stx.insert(x[i]);
	for (i=1;i<=ny;i++)
		sty.insert(y[i]);
	set<int>::iterator l,t,r;
	for (i=n;i;i--)
	{
		ans[i]=(ll)maxx*maxy;
		if (ch[i]=='H')
		{
			l=r=t=stx.lower_bound(a[i]);  //////////这里出bug了！！！
			l--;
			r++;
			stx.erase(t);
			maxx=max(maxx,*r-*l);
		}
		else
		{
			l=r=t=sty.lower_bound(a[i]);
			l--;
			r++;
			sty.erase(t);
			maxy=max(maxy,*r-*l);
		}
	}
	for (i=1;i<=n;i++)
		cout<<ans[i]<<endl;
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e6+54;
const ll INF=1e18;
const ll M=2222;
const ll mod=1e9+7;
ll a[N],n,m,x,y,z,head[N],to[N],val[N],nex[N],cnt,dis[N],vis[N];
string s,ss;
vector<ll>ve,ve1;
void run()
{
    ve.clear();
    ve1.clear();
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        if(a[i]&1)ve.push_back(i);
        else ve1.push_back(i);
    }
    if(ve.size()>=2)
    {
        cout<<2<<endl;
        cout<<ve[0]<<" "<<ve[1]<<endl;
    }
    else if(ve1.size()>=1)
    {
        cout<<1<<endl;
        cout<<ve1[0]<<endl;
    }
    else cout<<-1<<endl;

}
int main()
{
    ll T;cin>>T;
    while(T--)
    run();
    return 0;
}


#include<bits/stdc++.h>
using namespace std;

int main(){
    int t
    cin >> t;
    while(t--){
        int n,x=INT_MAX,y = INT_MAX,z=INT_MAX;
        cin >> n;
        int arr[n];
        for(int i = 0 ; i < n ;i++){
            cin >> arr[i];
            if(arr[i]%2 == 0){
                z = i;
            }
            else if(x == INT_MAX){
                x = i;
            }
            else{
                y = i;
            }
        }
        if(z == INT_MAX && x!=INT_MAX && y!=INT_MAX){
            cout << y << x << endl;
        }
        else if(z!=INT_MAX){
            cout << z;
        }
        else{
            cout << -1 << endl;
        }
    }
}


#include<bits/stdc++.h>
using namespace std;

int main(){
    int t;
    cin >> t;
    while(t--){
        int n,x=INT_MAX,y = INT_MAX,z=INT_MAX;
        cin >> n;
        int arr[n];
        for(int i = 0 ; i < n ;i++){
            cin >> arr[i];
            if(arr[i]%2 == 0){
                z = i;
            }
            else if(x == INT_MAX){
                x = i;
            }
            else{
                y = i;
            }
        }
        if(z == INT_MAX && x!=INT_MAX && y!=INT_MAX){
            cout << 2 << endl;
            cout << x+1 << " " << y+1 << endl;
        }
        else if(z!=INT_MAX){
            cout << 1 << endl;
            cout << z+1 << endl;
        }
        else{
            cout << 1 << endl;
            cout << -1 << endl;
        }
    }
}


#include<bits/stdc++.h>
using namespace std;

int main(){
    int t;
    cin >> t;
    while(t--){
        int n,x=INT_MAX,y = INT_MAX,z=INT_MAX;
        cin >> n;
        int arr[n];
        for(int i = 0 ; i < n ;i++){
            cin >> arr[i];
            if(arr[i]%2 == 0){
                z = i;
            }
            else if(x == INT_MAX){
                x = i;
            }
            else{
                y = i;
            }
        }
        if(z == INT_MAX && x!=INT_MAX && y!=INT_MAX){
            cout << y << x << endl;
        }
        else if(z!=INT_MAX){
            cout << z;
        }
        else{
            cout << -1 << endl;
        }
    }
}


#include<bits/stdc++.h>
using namespace std;

int main(){
    int t;
    cin >> t;
    while(t--){
        int n,x=INT_MAX,y = INT_MAX,z=INT_MAX;
        cin >> n;
        int arr[n];
        for(int i = 0 ; i < n ;i++){
            cin >> arr[i];
            if(arr[i]%2 == 0){
                z = i;
            }
            else if(x == INT_MAX){
                x = i;
            }
            else{
                y = i;
            }
        }
        if(z == INT_MAX && x!=INT_MAX && y!=INT_MAX){
            cout << 2 << endl;
            cout << x+1 << " " << y+1 << endl;
        }
        else if(z!=INT_MAX){
            cout << 1 << endl;
            cout << z+1 << endl;
        }
        else{
      //      cout << 1 << endl;
            cout << -1 << endl;
        }
    }
}


#include<bits/stdc++.h>
using namespace std;

int main(){
    int t;
    cin >> t;
    while(t--){
        int n,x=INT_MAX,y = INT_MAX,z=INT_MAX;
        cin >> n;
        int arr[n];
        for(int i = 0 ; i < n ;i++){
            cin >> arr[i];
            if(arr[i]%2 == 0){
                z = i;
            }
            else if(x == INT_MAX){
                x = i;
            }
            else{
                y = i;
            }
        }
        if(z == INT_MAX && x!=INT_MAX && y!=INT_MAX){
            cout << 2 << endl;
            cout << y+1 << x+1 << endl;
        }
        else if(z!=INT_MAX){
            cout << 1 << endl;
            cout << z+1 << endl;
        }
        else{
            cout << 1 << endl;
            cout << -1 << endl;
        }
    }
}


#include <string>
#include <iostream>

using namespace std;

int main()
{
    int t,n,a[100];
    cin>>t;
    for(int i=1;i<=t;i++)
    {
        cin>>n;
        if(n==1)
        {
            cin>>a[0];
            if(a[0]%2==0)
            {
                cout<<"1\n";
                cout<<"1\n";
                continue;
            }
            else
            {
                cout<<"-1\n";
            }
        }
        else
        {
            int flag=0;
            for(int k=0;k<n;k++)
            {
                cin>>a[k];
            }
            for(int j=0;j<2;j++)
            {
                if(a[j]%2==0)
                {
                    cout<<"1\n";
                    cout<<j+1<<"\n";
                    flag=1;
                    break;
                }
            }
            if(flag==0)
            {
                cout<<"2\n";
                for(int h=0;h<2;h++)
                {
                    cout<<h+1<<"\n";
                }
            }
        }

    }

    return 0;
}


#include <string>
#include <iostream>

using namespace std;

int main()
{
    int t,n,a[100],flag=0;
    cin>>t;
    for(int i=0;i<t;i++)
    {
        cin>>n;
        if(n==1)
        {
            cin>>a[0];
            if(a[0]%2==0)
            {
                cout<<"1\n";
                cout<<"1\n";
                break;
            }
            else
            {
                cout<<"-1\n";
            }
        }
        else
        {
            for(int k=0;k<n;k++)
            {
                cin>>a[k];
            }
            for(int j=0;j<n;j++)
            {
                if(a[j]%2==0)
                {
                    cout<<"1\n";
                    cout<<j+1<<"\n";
                    flag=1;
                break;
                }
            }
            if(flag==0)
            {
                cout<<"2\n";
                for(int h=0;h<n;h++)
                {
                    cout<<h+1<<"\n";
                }
            }
        }

    }

    return 0;
}


#include <string>
#include <iostream>

using namespace std;

int main()
{
    int t,n,a[100];
    cin>>t;
    for(int i=1;i<=t;i++)
    {
       int flag=0;
        cin>>n;
        if(n==1)
        {
            cin>>a[0];
            if(a[0]%2==0)
            {
                cout<<"1\n";
                cout<<"1\n";
                continue;
            }
            else
            {
                cout<<"-1\n";
            }
        }
        else
        {
            for(int k=0;k<n;k++)
            {
                cin>>a[k];
            }
            for(int j=0;j<n;j++)
            {
                if(a[j]%2==0)
                {
                    cout<<"1\n";
                    cout<<j+1<<"\n";
                    flag=1;
                    break;
                }
            }
            if(flag==0)
            {
                cout<<"2\n";
                for(int h=0;h<n;h++)
                {
                    cout<<h+1<<"\n";
                }
            }
        }

    }

    return 0;
}


#include <string>
#include <iostream>

using namespace std;

int main()
{
    int t,n,a[100],flag=0;
    cin>>t;
    for(int i=1;i<=t;i++)
    {
        cin>>n;
        if(n==1)
        {
            cin>>a[0];
            if(a[0]%2==0)
            {
                cout<<"1\n";
                cout<<"1\n";
                continue;
            }
            else
            {
                cout<<"-1\n";
            }
        }
        else
        {
            for(int k=0;k<n;k++)
            {
                cin>>a[k];
            }
            for(int j=0;j<n;j++)
            {
                if(a[j]%2==0)
                {
                    cout<<"1\n";
                    cout<<j+1<<"\n";
                    flag=1;
                    break;
                }
            }
            if(flag==0)
            {
                cout<<"2\n";
                for(int h=0;h<n;h++)
                {
                    cout<<h+1<<"\n";
                }
            }
        }

    }

    return 0;
}


#include <string>
#include <iostream>

using namespace std;

int main()
{
    int t,n,a[100],flag=0;
    cin>>t;
    for(int i=0;i<t;i++)
    {
        cin>>n;
        if(n==1)
        {
            cin>>a[0];
            if(a[0]%2==0)
            {
                cout<<"1\n";
                break;
            }
            else
            {
                cout<<"-1\n";
            }
        }
        else
        {
            for(int k=0;k<n;k++)
            {
                cin>>a[k];
            }
            for(int j=0;j<n;j++)
            {
                if(a[j]%2==0)
                {
                    cout<<j+1<<"\n";
                    flag=1;
                break;
                }
            }
            if(flag==0)
            {
                for(int h=0;h<n;h++)
                {
                    cout<<h+1<<"\n";
                }
            }
        }

    }

    return 0;
}


#include <string>
#include <iostream>

using namespace std;

int main()
{
    int t,n,a[100];
    cin>>t;
    for(int i=1;i<=t;i++)
    {
        cin>>n;
        if(n==1)
        {
            cin>>a[0];
            if(a[0]%2==0)
            {
                cout<<"1\n";
                cout<<"1\n";
                continue;
            }
            else
            {
                cout<<"-1\n";
            }
        }
        else
        {
            int flag=0;
            for(int k=0;k<n;k++)
            {
                cin>>a[k];
            }
            for(int j=0;j<n;j++)
            {
                if(a[j]%2==0)
                {
                    cout<<"1\n";
                    cout<<j+1<<"\n";
                    flag=1;
                    break;
                }
            }
            if(flag==0)
            {
                cout<<"2\n";
                for(int h=0;h<n;h++)
                {
                    cout<<h+1<<"\n";
                }
            }
        }

    }

    return 0;
}


#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false)
#define itt cin.tie(0)
#define now cout.tie(0)
using namespace std;
int main()
{
	fast;itt;now;
	int t;
	int count=0;
	 cin>>t;
	 for(int u=0; u<t; u++)
	 {
	 	int sum=0;
	 	int index=0;
	 	int n;
	 	cin>>n;
	 	int arr[n];
	 	for(int i=0; i<n; i++)
	 	{
	 	cin>>arr[i];
	 	if(arr[i]%2==0)
			index=i+1;
	 	}
	 		if(index!=0)
	 		{
	 			cout<<1<<endl;
	 		cout<<index<<endl;
	 		count++;
	 	}
	 		else
	 			for(int i=0; i<n; i++)
	 				{
	 					sum+=arr[i];
						if(sum%2==0)
						{
							cout<<i+1<<endl;
							count++;
							for(int j=1; j<i+2; j++)
								{

									cout<<j<<" ";
	 							}
	 							cout<<endl;
	 					}
	 				}
		 if(count==0)
	 		cout<<-1<<endl;
	 	count=0;
	}
}


#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false)
#define itt cin.tie(0)
#define now cout.tie(0)
using namespace std;
int main()
{
	fast;itt;now;
	int t;
	vector<int>v;
	bool test=true;
	int count=0;
	 cin>>t;
	 for(int u=0; u<t; u++)
	 {
	 	int sum=0;
	 	int index=0;
	 	int n;
	 	cin>>n;
	 	int arr[n];
	 	for(int i=0; i<n; i++)
	 	{
	 	cin>>arr[i];
	 	if(arr[i]%2==0 && test)
	 	{
	 		test=false;
	 		cout<<1<<endl;
	 		cout<<i+1<<endl;
		}
		if(arr[i]%2==1)
		{
			v.push_back(i+1);
			count++;
			if(count%2==0 && test)
			{
				test=false;
				cout<<count<<endl;
				for(int j=0; j<2; j++)
				{
					cout<<v[j]<<" ";

				}
				cout<<endl;
			}

		}
	 	}
		if(test)
		cout<<-1<<endl;
		count=0;
		v.clear();
		test=true;

	}
}


#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false)
#define itt cin.tie(0)
#define now cout.tie(0)
using namespace std;
int main()
{
	fast;itt;now;
	int t;
	bool count=false;
	 cin>>t;
	 for(int u=0; u<t; u++)
	 {
	 	int sum=0;
	 	int index=0;
	 	int n;
	 	cin>>n;
	 	int arr[n];
	 	for(int i=0; i<n; i++)
	 	{
	 	cin>>arr[i];
	 	}
	 for(int i=0; i<n; i++)
	 {
	 	for(int j=i; j<n; j++)
	 	{
	    	sum+=arr[j];
	    	if(sum%2==0)
	    	{
	    		count=true;
	    		cout<<j-i+1<<endl;
	    		for(int y=i+1; y<j+2; y++)
	    		cout<<y<<" ";
	    		cout<<endl;
	    		break;
	    	}

		}
		if(count)
		break;
	}
	if(!count)
	cout<<-1<<endl;
	count=false;

	}
}


#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false)
#define itt cin.tie(0)
#define now cout.tie(0)
using namespace std;
int main()
{
	fast;itt;now;
	int t;
	vector<int>v;
	bool test=true;
	int count=0;
	 cin>>t;
	 for(int u=0; u<t; u++)
	 {
	 	int sum=0;
	 	int index=0;
	 	int n;
	 	cin>>n;
	 	int arr[n];
	 	for(int i=0; i<n; i++)
	 	{
	 	cin>>arr[i];
	 	if(arr[i]%2==0 && test)
	 	{
	 		test=false;
	 		cout<<1<<endl;
	 		cout<<i+1<<endl;
		}
		if(arr[i]%2==1)
		{
			v.push_back(i+1);
			count++;
			if(count%2==0 && test)
			{
				test=false;
				cout<<count<<endl;
				for(int j=0; j<2; j++)
				{
					cout<<v[j]<<" ";

				}
				cout<<endl;
			}

		}
	 	}
		if(test)
		cout<<-1<<endl;
		count=0;
		test=true;

	}
}


#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false)
#define itt cin.tie(0)
#define now cout.tie(0)
using namespace std;
int main()
{
	fast;itt;now;
	int t;
	int count=0;
	 cin>>t;
	 for(int u=0; u<t; u++)
	 {
	 	int sum=0;
	 	int index=0;
	 	int n;
	 	cin>>n;
	 	int arr[n];
	 	for(int i=0; i<n; i++)
	 	{
	 	cin>>arr[i];
	 	if(arr[i]%2==0)
			index=i+1;
	 	}
	 		if(index!=0)
	 		{
	 			cout<<1<<endl;
	 		cout<<index<<endl;
	 		count++;
	 	}
	 		else
	 			for(int i=0; i<n; i++)
	 				{
	 					sum+=arr[i];
						if(sum%2==0)
						{
							cout<<i+2<<endl;
							count++;
							for(int j=1; j<i+2; j++)
								{

									cout<<j<<" ";
	 							}
	 							cout<<endl;
	 					}
	 				}
		 if(count==0)
	 		cout<<-1<<endl;
	 	count=0;
	}
}


#include <bits/stdc++.h>

using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin >> t;
	while (t--) {
		int n;
		bool flag = false;
		cin >> n;
		vector<int> a(n);
		for (int i = 0; i < n; i++) cin >> a[i];
		for (int i = 0; i < n; i++) {
			if (i + 1 < n) {
				if ((a[i] + a[i + 1]) % 2 == 0) {
					cout << "2\n";
					cout << i + 1 << ' ' << i + 2 << '\n';
					flag = true;
				} else if (a[i] % 2 == 0) {
					cout << "1\n";
					cout << i + 1 << '\n';
					flag = true;
				}
			} else if (n == 1 && a[i] % 2 == 0 ) {
				cout << "1\n1\n";
				flag = true;
			}
			if (flag) break;
		}
		if (flag == false) cout << "-1\n";
		a.clear();
	}
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin >> t;
	while (t--) {
		int n;
		bool ok = false;
		cin >> n;
		vector<int> a(n);
		for (int i = 0; i < n; i++) cin >> a[i];
		for (int i = 0; i < n; i++) {
		    int sum = a[i];
		    if (sum % 2 == 0) {
		        cout << "1\n" << i + 1;
		        ok = true;
		        break;
		    }
		    for (int j = i + 1; j < n; j++) {
		        sum += a[j];
		        if (sum % 2 == 0) {
		            cout << j - i + 1 << '\n';
		            for (int k = i; k <= j; k++) cout << k + 1 << ' ';
		            ok = true;
		            break;
		        }
		    }
		    if (ok) break;
		}
		a.clear();
		if (ok == false) cout << "-1";
		cout << '\n';
	}
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin >> t;
	while (t--) {
		int n;
		bool flag = false;
		cin >> n;
		vector<int> a(n);
		for (int i = 0; i < n; i++) cin >> a[i];
		for (int i = 0; i < n; i++) {
			if (i + 1 < n) {
				if ((a[i] + a[i + 1]) % 2 == 0) {
					cout << "2\n";
					cout << i + 1 << ' ' << i + 2 << '\n';
					flag = true;
				} else if (a[i] % 2 == 0) {
					cout << "1\n";
					cout << i + 1 << '\n';
					flag = true;
				}
			} else if (n == 1) {
				cout << "1\n1\n";
				flag = true;
			}
			if (flag) break;
		}
		if (flag == false) cout << "-1\n";
		a.clear();
	}
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin >> t;
	while (t--) {
		int n, sum1 = 0, sum2 = 0;
		bool ok = false;
		cin >> n;
		vector<int> a(n);
		for (int i = 0; i < n; i++) {
		    cin >> a[i];
		    if (i > 0) sum2 += a[i];
		}
		sum1 = a[0];
		for (int i = 0; i < n; i++) {
		    if (sum1 % 2 == 0) {
		        cout << i + 1 << '\n';
		        for (int j = 0; j <= i; j++) cout << j + 1 << ' ';
		        ok = true;
		    } else if (sum2 % 2 == 0 && sum2 > 0) {
		        cout << n - i << '\n';
		        for (int j = i + 1; j <= n; j++) cout << j << ' ';
		        ok = true;
		    } else {
		        if (i + 1 < n) {
		            sum1 += a[i + 1];
		            sum2 -= a[i + 1];
		        }
		    }
		    if (ok) break;
		}
		a.clear();
		if (ok == false) cout << "-1";
		cout << '\n';
	}
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin >> t;
	while (t--) {
		int n;
		bool flag = false;
		cin >> n;
		vector<int> a(n);
		for (int i = 0; i < n; i++) cin >> a[i];
		for (int i = 0; i < n; i++) {
			if (i + 1 < n) {
				if ((a[i] + a[i + 1]) % 2 == 0) {
					cout << "2\n";
					cout << i + 1 << ' ' << i + 2 << '\n';
					flag = true;
				} else if (a[i] % 2 == 0) {
					cout << "1\n";
					cout << i + 1 << '\n';
					flag = true;
				}
			}
			if (flag) break;
		}
		if (flag == false) cout << "-1\n";
		a.clear();
	}
	return 0;
}


#include <bits/stdc++.h>
using namespace std;

int main(){
int t;
cin>>t;
while(t--){
	int n;
	cin>>n;
	vector<int> v;
	vector<int> v2;
	bool flag=false;
	for(int i=1;i<=n;i++){
	int a;
	scanf("%d",&a);
	if(flag)continue;
	if(a%2==0){
		cout<<1<<"\n"<<i<<endl;
		flag=true;;
	}
	else{
	v.push_back(i);
	v2.push_back(a);
	if(v.size()==2){
		cout<<2<<"\n"<<v[0]<<' '<<v[1]<<endl;
		flag=true;
	}
	}
	}
	if(!flag)cout<<-1<<endl;
}
return 0;
}


#include <bits/stdc++.h>
using namespace std;

int main(){
int t;
cin>>t;
while(t--){
	int n;
	cin>>n;
	vector<int> v;
	bool flag=false;
	for(int i=1;i<=n;i++){
	int a;
	scanf("%d",&a);
	if(a%2==0&&!flag){
		cout<<1<<"\n"<<i<<endl;
		flag=true;;
	}
	else {
	v.push_back(i);
	if(v.size()==2&&!flag){
		cout<<2<<"\n"<<v[0]<<' '<<v[1];
		flag=true;
	}
	}
	}
	if(!flag)cout<<-1<<endl;
}
return 0;
}


#include <bits/stdc++.h>
using namespace std;

int main(){
int t;
cin>>t;
while(t--){
	int n;
	cin>>n;
	vector<int> v;
	vector<int> v2;
	bool flag=false;
	for(int i=1;i<=n;i++){
	int a;
	scanf("%d",&a);
	if(a%2==0&&!flag){
		cout<<1<<"\n"<<i<<endl;
		flag=true;;
	}
	else {
	v.push_back(i);
	v2.push_back(a);
	if(v.size()==2&&!flag){
		if(v2[0]!=v2[1])cout<<2<<"\n"<<v[0]<<' '<<v[1]<<endl;
		else cout<<1<<"\n"<<v[0]<<endl;
		flag=true;
	}
	}
	}
	if(!flag)cout<<-1<<endl;
}
return 0;
}


#include <bits/stdc++.h>
using namespace std;

int main(){
int t;
cin>>t;
while(t--){
	int n;
	cin>>n;
	vector<int> v;
	vector<int> v2;
	bool flag=false;
	for(int i=1;i<=n;i++){
	int a;
	scanf("%d",&a);
	if(a%2==0&&!flag){
		cout<<1<<"\n"<<i<<endl;
		flag=true;;
	}
	else if(!flag){
	v.push_back(i);
	v2.push_back(a);
	if(v.size()==2){
		if(v2[0]!=v2[1])cout<<2<<"\n"<<v[0]<<' '<<v[1]<<endl;
			else cout<<2<<"\n"<<v[0]<<endl;
		flag=true;
	}
	}
	}
	if(!flag)cout<<-1<<endl;
}
return 0;
}


#include <bits/stdc++.h>
using namespace std;

int main(){
int t;
cin>>t;
while(t--){
	int n;
	cin>>n;
	vector<int> v;
	vector<int> v2;
	bool flag=false;
	for(int i=1;i<=n;i++){
	int a;
	scanf("%d",&a);
	if(a%2==0&&!flag){
		cout<<1<<"\n"<<i<<endl;
		flag=true;;
	}
	else {
	v.push_back(i);
	v2.push_back(a);
	if(v.size()==2&&!flag){
		if(v2[0]!=v2[1])cout<<2<<"\n"<<v[0]<<' '<<v[1]<<endl;
			else cout<<2<<"\n"<<v[0]<<endl;
		flag=true;
	}
	}
	}
	if(!flag)cout<<-1<<endl;
}
return 0;
}


#include <bits/stdc++.h>
using namespace std;

int main(){
int t;
cin>>t;
while(t--){
	int n;
	cin>>n;
	vector<int> v;
	vector<int> v2;
	bool flag=false;
	for(int i=1;i<=n;i++){
	int a;
	scanf("%d",&a);
	if(a%2==0&&!flag){
		cout<<1<<"\n"<<i<<endl;
		flag=true;;
	}
	else {
	v.push_back(i);
	v2.push_back(a);
	if(v.size()==2&&!flag){
		if(v2[0]!=v2[1])cout<<2<<"\n"<<v[0]<<' '<<v[1];
		else cout<<1<<"\n"<<v[0];
		flag=true;
	}
	}
	}
	if(!flag)cout<<-1<<endl;
}
return 0;
}


#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define pb push_back
#define first fi
#define second se
#define IO std::ios::sync_with_stdio(false)
typedef long long ll;
const int maxn = 100008;
const ll mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const ll INF = 1e18 + 10;
const double eps = 1e-6;
using namespace std;
int T,n;
int a[maxn],vis[2];
int main()
{
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		memset(vis,0,sizeof(vis));
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
			if(a[i]&1) vis[1]++;
			else vis[0]++;
		}
		if(vis[1]%2==0){
			int q=0;
			int ans=0;
			printf("2\n");
			for(int i=1;i<=n;i++){
				if(a[i]&1){
					q++;
					printf("%d ",i );
					ans+=a[i];
				}
				if(q==2) break;
			}
			cout<<endl;
		}
		else if(vis[2]){
			bool q=true;
			printf("1\n");
			for(int i=1;i<=n;i++){
				if(a[i]%2==0){
					q=false;
					printf("%d\n", i);
				}
				if(!q) break;
			}
			cout<<endl;
		}
		else printf("-1\n");
	}
}


#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define pb push_back
#define first fi
#define second se
#define IO std::ios::sync_with_stdio(false)
typedef long long ll;
const int maxn = 100008;
const ll mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const ll INF = 1e18 + 10;
const double eps = 1e-6;
using namespace std;
int T,n;
int a[maxn],vis[2];
int main()
{
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		memset(vis,0,sizeof(vis));
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
			if(a[i]&1) vis[1]++;
			else vis[0]++;
		}
		if(vis[1]%2==0){
			int q=0;
			for(int i=1;i<=n;i++){
				if(a[i]&1){
					q++;
					printf("%d ",i );
				}
				if(q==2) break;
			}
		}
		else if(vis[2]){
			bool q=true;
			for(int i=1;i<=n;i++){
				if(a[i]%2==0){
					q=false;
					printf("%d\n", i);
				}
				if(!q) break;
			}
		}
		else printf("-1\n");
	}
}


#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define pb push_back
#define first fi
#define second se
#define IO std::ios::sync_with_stdio(false)
typedef long long ll;
const int maxn = 100008;
const ll mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const ll INF = 1e18 + 10;
const double eps = 1e-6;
using namespace std;
int T,n;
int a[maxn],vis[2];
int main()
{
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		memset(vis,0,sizeof(vis));
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
			if(a[i]&1) vis[1]++;
			else vis[0]++;
		}
		if(vis[1]&&vis[1]%2==0){
			int q=0;
			int ans=0;
			printf("2\n");
			for(int i=1;i<=n;i++){
				if(a[i]&1){
					q++;
					printf("%d ",i );
					ans+=a[i];
				}
				if(q==2) break;
			}
			cout<<endl;
		}
		else if(vis[0]){
			bool q=true;
			printf("1\n");
			for(int i=1;i<=n;i++){
				if(a[i]%2==0){
					q=false;
					printf("%d\n", i);
				}
				if(!q) break;
			}
		}
		else printf("-1\n");
	}
}


#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define pb push_back
#define first fi
#define second se
#define IO std::ios::sync_with_stdio(false)
typedef long long ll;
const int maxn = 100008;
const ll mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const ll INF = 1e18 + 10;
const double eps = 1e-6;
using namespace std;
int T,n;
int a[maxn],vis[2];
int main()
{
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		memset(vis,0,sizeof(vis));
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
			if(a[i]&1) vis[1]++;
			else vis[0]++;
		}
		if(vis[1]%2==0){
			int q=0;
			int ans=0;
			printf("2\n");
			for(int i=1;i<=n;i++){
				if(a[i]&1){
					q++;
					printf("%d ",i );
					ans+=a[i];
				}
				if(q==2) break;
			}
			cout<<endl;
		}
		else if(vis[2]){
			bool q=true;
			printf("1\n");
			for(int i=1;i<=n;i++){
				if(a[i]%2==0){
					q=false;
					printf("%d\n", i);
				}
				if(!q) break;
			}
		}
		else printf("-1\n");
	}
}


#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define pb push_back
#define first fi
#define second se
#define IO std::ios::sync_with_stdio(false)
typedef long long ll;
const int maxn = 100008;
const ll mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const ll INF = 1e18 + 10;
const double eps = 1e-6;
using namespace std;
int T,n;
int a[maxn],vis[2];
int main()
{
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		memset(vis,0,sizeof(vis));
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
			if(a[i]&1) vis[1]++;
			else vis[0]++;
		}
		if(vis[1]&&vis[1]%2==0){
			int q=0;
			int ans=0;
			printf("2\n");
			for(int i=1;i<=n;i++){
				if(a[i]&1){
					q++;
					printf("%d ",i );
					ans+=a[i];
				}
				if(q==2) break;
			}
			cout<<endl;
		}
		else if(vis[2]){
			bool q=true;
			printf("1\n");
			for(int i=1;i<=n;i++){
				if(a[i]%2==0){
					q=false;
					printf("%d\n", i);
				}
				if(!q) break;
			}
		}
		else printf("-1\n");
	}
}


#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define pb push_back
#define first fi
#define second se
#define IO std::ios::sync_with_stdio(false)
typedef long long ll;
const int maxn = 100008;
const ll mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const ll INF = 1e18 + 10;
const double eps = 1e-6;
using namespace std;
int T,n;
int a[maxn],vis[2];
int main()
{
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		memset(vis,0,sizeof(vis));
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
			if(a[i]&1) vis[1]++;
			else vis[0]++;
		}
		if(vis[1]>=2){
			int q=0;
			int ans=0;
			printf("2\n");
			for(int i=1;i<=n;i++){
				if(a[i]&1){
					q++;
					printf("%d ",i );
				}
				if(q==2) break;
			}
			cout<<endl;
		}
		else if(vis[0]){
			bool q=true;
			printf("1\n");
			for(int i=1;i<=n;i++){
				if(a[i]%2==0){
					q=false;
					printf("%d\n", i);
				}
				if(!q) break;
			}
		}
		else printf("-1\n");
	}
}


// In The Name of ALLAH
// Saiful Islam Tarek
//CSECU

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define _er(i,x,y) for(ll i=x;i<y;i++)
#define _ero(i,x,y) for(ll i=x;i<=y;i++)
#define _inf(i,x) for(ll i=x;;i++)
#define S(n) string n
#define sr(absd) sort(absd.begin(),absd.end())
#define srt(x) sort(arr,arr+x)
#define in(n) scanf("%lld",&n)
#define inn(n,m) scanf("%lld %lld",&n,&m)
#define inr(i) cin>>arr[i]
#define pr(n) cout<<n<<endl
#define par(i) cout<<arr[i]<<" "
#define SL(asd) (int)asd.length()
#define endl '\n'
#define INF 1000000000000
#define MX 1000000
#define pb                  push_back

ll isprime( ll a0)
{
    //cout<<a0;
    ll n=a0,a=0;
    if (n==2)
    {
        return 1;
    }
    if (n==1)
    {
        return 0;
    }

    for(ll i=2; i*i<=n; i++)
    {
        if (n%i==0)
        {
            a=1;
            break;
        }
    }
    if (a==1)
    {
        return 0;
    }
    else
    {
        return 1;
    }
}
/*
ll arr[1000005],TREE[1000005*4];
void init(ll node,ll b,ll e)
{
    if(b==e)
    {
        TREE[node]=arr[b];
        return;
    }
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    init(LEFT,b,mid);
    init(RIGHT,mid+1,e);
    TREE[node] = TREE[LEFT] + TREE[RIGHT];
    //TREE[node] = min(TREE[LEFT],TREE[RIGHT]);
    //  TREE[node] = max(TREE[LEFT],TREE[RIGHT]);
}
ll QUERY(ll node,ll b,ll e,ll s,ll d)
{
    if(s>e || d<b)
    {
        return 0;
        // return INT_MAX;
        // return INT_MIN;
    }

    if(b>=s && e<=d)
        return TREE[node];
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    ll p1 = QUERY(LEFT,b,mid,s,d);
    ll p2 = QUERY(RIGHT,mid+1,e,s,d);
    return p1+p2;
    // return min(p1,p2);
    // return max(p1,p2);
}

void UPDATE(ll node,ll b,ll e,ll s,ll newval)
{
    if(s>e || s<b)
        return;
    if(b>=s && e<=s)
    {

        TREE[node] = newval;
        return;

    }
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    UPDATE(LEFT,b,mid,s,newval);
    UPDATE(RIGHT,mid+1,e,s,newval);
    TREE[node]= TREE[LEFT] + TREE[RIGHT] ;

}

ll ma = 100000000000000,temp;
int main()
{
    ll t;
    in(t);
    _ero(i,1,t)
    {
        ll n,m;
    inn(n,m);
    _ero(i,1,n)
    cin>>arr[i];
    init(1,1,n);
    cout<<"Case "<<i<<":\n";

    _er(i,0,m)
    {
        ll a,b;
        inn(a,b);
        cout<<QUERY(1,1,n,a,b)<<endl;
        UPDATE(1,1,n,2,0);
        cout<<QUERY(1,1,n,a,b)<<endl;
    }

    }

    return 0;
}
*/
/*
                                     LAZY PROPAGTION :
ll arr[1000];
struct info
{
    ll prop,SUM;
} TREE[5000];
void init(ll node,ll b,ll e)
{
    if(b==e)
    {
        TREE[node].SUM=arr[b];
        return;
    }
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    init(LEFT,b,mid);
    init(RIGHT,mid+1,e);
    TREE[node].SUM = TREE[LEFT].SUM + TREE[RIGHT].SUM;
    //TREE[node].SUM = min(TREE[LEFT].SUM,TREE[RIGHT].SUM);
  // TREE[node].SUM = max(TREE[LEFT].SUM,TREE[RIGHT].SUM);
}
void UPDATE(ll node,ll b,ll e,ll s,ll d,ll x)
{
    if(s>e || d<b)
        return;
    if(b>=s && e<=d)
    {
        TREE[node].SUM += ((e-b+1)*x);
        TREE[node].prop+=x;
        return;
    }
    ll LEFT = node *2;
    ll RIGHT = node * 2 + 1;
    ll mid = (b+e)/2;
    UPDATE(LEFT,b,mid,s,d,x);
    UPDATE(RIGHT,mid+1,e,s,d,x);
    TREE[node].SUM = TREE[LEFT].SUM + TREE[RIGHT].SUM + (e-b+1)*TREE[node].prop;

}
ll QUERY(ll node,ll b,ll e, ll s,ll d,ll carry)
{
    if(s>e || d<b)
    {
         return 0;
        // return INT_MAX;
         //return INT_MIN;
    }

    if(b>=s && e<=d)
        return TREE[node].SUM + carry * (e-b+1);
    ll LEFT = node << 1;
    ll RIGHT = (node << 1) + 1;
    ll mid = (b + e) >> 1;
    ll p1 = QUERY(LEFT,b,mid,s,d,carry + TREE[node].prop);
    ll p2 = QUERY(RIGHT,mid+1,e,s,d,carry + TREE[node].prop);
    return p1+p2;
   // return max(p1,p2);
   // return min(p1,p2);
}
*/

int main()
{

   ll t;
   cin>>t;
   while(t--)
   {
       ll n,s=0;
       cin>>n;
     ll arr[n+2];
     _ero(i,1,n)
     {
          cin>>arr[i];
          if(s==0)
          {
               if(arr[i]%2==0)
            s=i;
          }

     }
  if(s>0)
     {
         cout<<1<<endl;
         cout<<s<<endl;

     }
    else if(n==1)
        cout<<-1<<endl;

     else
     {
         cout<<2<<endl;
        cout<<1<<" "<<2<<endl;
     }

   }
    return 0;
}


// In The Name of ALLAH
// Saiful Islam Tarek
//CSECU

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define _er(i,x,y) for(ll i=x;i<y;i++)
#define _ero(i,x,y) for(ll i=x;i<=y;i++)
#define _inf(i,x) for(ll i=x;;i++)
#define S(n) string n
#define sr(absd) sort(absd.begin(),absd.end())
#define srt(x) sort(arr,arr+x)
#define in(n) scanf("%lld",&n)
#define inn(n,m) scanf("%lld %lld",&n,&m)
#define inr(i) cin>>arr[i]
#define pr(n) cout<<n<<endl
#define par(i) cout<<arr[i]<<" "
#define SL(asd) (int)asd.length()
#define endl '\n'
#define INF 1000000000000
#define MX 1000000
#define pb                  push_back
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
ll isprime( ll a0)
{
    //cout<<a0;
    ll n=a0,a=0;
    if (n==2)
    {
        return 1;
    }
    if (n==1)
    {
        return 0;
    }

    for(ll i=2; i*i<=n; i++)
    {
        if (n%i==0)
        {
            a=1;
            break;
        }
    }
    if (a==1)
    {
        return 0;
    }
    else
    {
        return 1;
    }
}
/*
ll arr[1000005],TREE[1000005*4];
void init(ll node,ll b,ll e)
{
    if(b==e)
    {
        TREE[node]=arr[b];
        return;
    }
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    init(LEFT,b,mid);
    init(RIGHT,mid+1,e);
    TREE[node] = TREE[LEFT] + TREE[RIGHT];
    //TREE[node] = min(TREE[LEFT],TREE[RIGHT]);
    //  TREE[node] = max(TREE[LEFT],TREE[RIGHT]);
}
ll QUERY(ll node,ll b,ll e,ll s,ll d)
{
    if(s>e || d<b)
    {
        return 0;
        // return INT_MAX;
        // return INT_MIN;
    }

    if(b>=s && e<=d)
        return TREE[node];
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    ll p1 = QUERY(LEFT,b,mid,s,d);
    ll p2 = QUERY(RIGHT,mid+1,e,s,d);
    return p1+p2;
    // return min(p1,p2);
    // return max(p1,p2);
}

void UPDATE(ll node,ll b,ll e,ll s,ll newval)
{
    if(s>e || s<b)
        return;
    if(b>=s && e<=s)
    {

        TREE[node] = newval;
        return;

    }
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    UPDATE(LEFT,b,mid,s,newval);
    UPDATE(RIGHT,mid+1,e,s,newval);
    TREE[node]= TREE[LEFT] + TREE[RIGHT] ;

}

ll ma = 100000000000000,temp;
int main()
{
    ll t;
    in(t);
    _ero(i,1,t)
    {
        ll n,m;
    inn(n,m);
    _ero(i,1,n)
    cin>>arr[i];
    init(1,1,n);
    cout<<"Case "<<i<<":\n";

    _er(i,0,m)
    {
        ll a,b;
        inn(a,b);
        cout<<QUERY(1,1,n,a,b)<<endl;
        UPDATE(1,1,n,2,0);
        cout<<QUERY(1,1,n,a,b)<<endl;
    }

    }

    return 0;
}
*/
/*
                                     LAZY PROPAGTION :
ll arr[1000];
struct info
{
    ll prop,SUM;
} TREE[5000];
void init(ll node,ll b,ll e)
{
    if(b==e)
    {
        TREE[node].SUM=arr[b];
        return;
    }
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    init(LEFT,b,mid);
    init(RIGHT,mid+1,e);
    TREE[node].SUM = TREE[LEFT].SUM + TREE[RIGHT].SUM;
    //TREE[node].SUM = min(TREE[LEFT].SUM,TREE[RIGHT].SUM);
  // TREE[node].SUM = max(TREE[LEFT].SUM,TREE[RIGHT].SUM);
}
void UPDATE(ll node,ll b,ll e,ll s,ll d,ll x)
{
    if(s>e || d<b)
        return;
    if(b>=s && e<=d)
    {
        TREE[node].SUM += ((e-b+1)*x);
        TREE[node].prop+=x;
        return;
    }
    ll LEFT = node *2;
    ll RIGHT = node * 2 + 1;
    ll mid = (b+e)/2;
    UPDATE(LEFT,b,mid,s,d,x);
    UPDATE(RIGHT,mid+1,e,s,d,x);
    TREE[node].SUM = TREE[LEFT].SUM + TREE[RIGHT].SUM + (e-b+1)*TREE[node].prop;

}
ll QUERY(ll node,ll b,ll e, ll s,ll d,ll carry)
{
    if(s>e || d<b)
    {
         return 0;
        // return INT_MAX;
         //return INT_MIN;
    }

    if(b>=s && e<=d)
        return TREE[node].SUM + carry * (e-b+1);
    ll LEFT = node << 1;
    ll RIGHT = (node << 1) + 1;
    ll mid = (b + e) >> 1;
    ll p1 = QUERY(LEFT,b,mid,s,d,carry + TREE[node].prop);
    ll p2 = QUERY(RIGHT,mid+1,e,s,d,carry + TREE[node].prop);
    return p1+p2;
   // return max(p1,p2);
   // return min(p1,p2);
}
*/

int main()
{
   fast;
   ll t;
   cin>>t;
   while(t--)
   {
       ll n,s=0;
       in(n);
     ll arr[n+2];
     _ero(i,1,n)
     {
          cin>>arr[i];
          if(s==0)
          {
               if(arr[i]%2==0)
            s=i;
          }

     }
  if(s>0)
     {
         cout<<1<<endl;
         cout<<s<<endl;

     }
    else if(n==1)
        cout<<-1<<endl;

     else
     {
         cout<<2<<endl;
        cout<<1<<" "<<2<<endl;
     }

   }
    return 0;
}


// In The Name of ALLAH
// Saiful Islam Tarek
//CSECU

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define _er(i,x,y) for(ll i=x;i<y;i++)
#define _ero(i,x,y) for(ll i=x;i<=y;i++)
#define _inf(i,x) for(ll i=x;;i++)
#define S(n) string n
#define sr(absd) sort(absd.begin(),absd.end())
#define srt(x) sort(arr,arr+x)
#define in(n) scanf("%lld",&n)
#define inn(n,m) scanf("%lld %lld",&n,&m)
#define inr(i) cin>>arr[i]
#define pr(n) cout<<n<<endl
#define par(i) cout<<arr[i]<<" "
#define SL(asd) (int)asd.length()
#define endl '\n'
#define INF 1000000000000
#define MX 1000000
#define pb                  push_back
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
ll isprime( ll a0)
{
    //cout<<a0;
    ll n=a0,a=0;
    if (n==2)
    {
        return 1;
    }
    if (n==1)
    {
        return 0;
    }

    for(ll i=2; i*i<=n; i++)
    {
        if (n%i==0)
        {
            a=1;
            break;
        }
    }
    if (a==1)
    {
        return 0;
    }
    else
    {
        return 1;
    }
}
/*
ll arr[1000005],TREE[1000005*4];
void init(ll node,ll b,ll e)
{
    if(b==e)
    {
        TREE[node]=arr[b];
        return;
    }
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    init(LEFT,b,mid);
    init(RIGHT,mid+1,e);
    TREE[node] = TREE[LEFT] + TREE[RIGHT];
    //TREE[node] = min(TREE[LEFT],TREE[RIGHT]);
    //  TREE[node] = max(TREE[LEFT],TREE[RIGHT]);
}
ll QUERY(ll node,ll b,ll e,ll s,ll d)
{
    if(s>e || d<b)
    {
        return 0;
        // return INT_MAX;
        // return INT_MIN;
    }

    if(b>=s && e<=d)
        return TREE[node];
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    ll p1 = QUERY(LEFT,b,mid,s,d);
    ll p2 = QUERY(RIGHT,mid+1,e,s,d);
    return p1+p2;
    // return min(p1,p2);
    // return max(p1,p2);
}

void UPDATE(ll node,ll b,ll e,ll s,ll newval)
{
    if(s>e || s<b)
        return;
    if(b>=s && e<=s)
    {

        TREE[node] = newval;
        return;

    }
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    UPDATE(LEFT,b,mid,s,newval);
    UPDATE(RIGHT,mid+1,e,s,newval);
    TREE[node]= TREE[LEFT] + TREE[RIGHT] ;

}

ll ma = 100000000000000,temp;
int main()
{
    ll t;
    in(t);
    _ero(i,1,t)
    {
        ll n,m;
    inn(n,m);
    _ero(i,1,n)
    cin>>arr[i];
    init(1,1,n);
    cout<<"Case "<<i<<":\n";

    _er(i,0,m)
    {
        ll a,b;
        inn(a,b);
        cout<<QUERY(1,1,n,a,b)<<endl;
        UPDATE(1,1,n,2,0);
        cout<<QUERY(1,1,n,a,b)<<endl;
    }

    }

    return 0;
}
*/
/*
                                     LAZY PROPAGTION :
ll arr[1000];
struct info
{
    ll prop,SUM;
} TREE[5000];
void init(ll node,ll b,ll e)
{
    if(b==e)
    {
        TREE[node].SUM=arr[b];
        return;
    }
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    init(LEFT,b,mid);
    init(RIGHT,mid+1,e);
    TREE[node].SUM = TREE[LEFT].SUM + TREE[RIGHT].SUM;
    //TREE[node].SUM = min(TREE[LEFT].SUM,TREE[RIGHT].SUM);
  // TREE[node].SUM = max(TREE[LEFT].SUM,TREE[RIGHT].SUM);
}
void UPDATE(ll node,ll b,ll e,ll s,ll d,ll x)
{
    if(s>e || d<b)
        return;
    if(b>=s && e<=d)
    {
        TREE[node].SUM += ((e-b+1)*x);
        TREE[node].prop+=x;
        return;
    }
    ll LEFT = node *2;
    ll RIGHT = node * 2 + 1;
    ll mid = (b+e)/2;
    UPDATE(LEFT,b,mid,s,d,x);
    UPDATE(RIGHT,mid+1,e,s,d,x);
    TREE[node].SUM = TREE[LEFT].SUM + TREE[RIGHT].SUM + (e-b+1)*TREE[node].prop;

}
ll QUERY(ll node,ll b,ll e, ll s,ll d,ll carry)
{
    if(s>e || d<b)
    {
         return 0;
        // return INT_MAX;
         //return INT_MIN;
    }

    if(b>=s && e<=d)
        return TREE[node].SUM + carry * (e-b+1);
    ll LEFT = node << 1;
    ll RIGHT = (node << 1) + 1;
    ll mid = (b + e) >> 1;
    ll p1 = QUERY(LEFT,b,mid,s,d,carry + TREE[node].prop);
    ll p2 = QUERY(RIGHT,mid+1,e,s,d,carry + TREE[node].prop);
    return p1+p2;
   // return max(p1,p2);
   // return min(p1,p2);
}
*/

int main()
{
   fast;
   ll t;
   cin>>t;
   while(t--)
   {
       ll n,s=0;
       in(n);
     ll arr[n+2];
     _ero(i,1,n)
     {
          cin>>arr[i];
          if(s==0)
          if(arr[i]%2==0)
            s=i;

     }

     if(n==1 && arr[1]%2!=0)
        cout<<-1<<endl;
     else if(s>0)
     {
         cout<<1<<endl;
         cout<<s<<endl;

     }
     else
     {
         cout<<2<<endl;
        cout<<1<<" "<<2<<endl;
     }

   }
    return 0;
}


// In The Name of ALLAH
// Saiful Islam Tarek
//CSECU

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define _er(i,x,y) for(ll i=x;i<y;i++)
#define _ero(i,x,y) for(ll i=x;i<=y;i++)
#define _inf(i,x) for(ll i=x;;i++)
#define S(n) string n
#define sr(absd) sort(absd.begin(),absd.end())
#define srt(x) sort(arr,arr+x)
#define in(n) scanf("%lld",&n)
#define inn(n,m) scanf("%lld %lld",&n,&m)
#define inr(i) cin>>arr[i]
#define pr(n) cout<<n<<endl
#define par(i) cout<<arr[i]<<" "
#define SL(asd) (int)asd.length()
#define endl '\n'
#define INF 1000000000000
#define MX 1000000
#define pb                  push_back

int main()
{

   ll t;
   cin>>t;
   while(t--)
   {
       ll n,s=0;
       cin>>n;
     ll arr[n+2];
     _ero(i,1,n)
     {
          cin>>arr[i];
          if(s==0)
          {
               if(arr[i]%2==0)
            s=i;
          }

     }
  if(s>0)
     {
         cout<<1<<endl;
         cout<<s<<endl;

     }
    else if(n==1)
        cout<<-1<<endl;

     else
     {
         cout<<2<<endl;
        cout<<1<<" "<<2<<endl;
     }

   }
    return 0;
}


// In The Name of ALLAH
// Saiful Islam Tarek
//CSECU

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define _er(i,x,y) for(ll i=x;i<y;i++)
#define _ero(i,x,y) for(ll i=x;i<=y;i++)
#define _inf(i,x) for(ll i=x;;i++)
#define S(n) string n
#define sr(absd) sort(absd.begin(),absd.end())
#define srt(x) sort(arr,arr+x)
#define in(n) scanf("%lld",&n)
#define inn(n,m) scanf("%lld %lld",&n,&m)
#define inr(i) cin>>arr[i]
#define pr(n) cout<<n<<endl
#define par(i) cout<<arr[i]<<" "
#define SL(asd) (int)asd.length()
#define endl '\n'
#define INF 1000000000000
#define MX 1000000
#define pb                  push_back
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

/*
ll arr[1000005],TREE[1000005*4];
void init(ll node,ll b,ll e)
{
    if(b==e)
    {
        TREE[node]=arr[b];
        return;
    }
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    init(LEFT,b,mid);
    init(RIGHT,mid+1,e);
    TREE[node] = TREE[LEFT] + TREE[RIGHT];
    //TREE[node] = min(TREE[LEFT],TREE[RIGHT]);
    //  TREE[node] = max(TREE[LEFT],TREE[RIGHT]);
}
ll QUERY(ll node,ll b,ll e,ll s,ll d)
{
    if(s>e || d<b)
    {
        return 0;
        // return INT_MAX;
        // return INT_MIN;
    }

    if(b>=s && e<=d)
        return TREE[node];
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    ll p1 = QUERY(LEFT,b,mid,s,d);
    ll p2 = QUERY(RIGHT,mid+1,e,s,d);
    return p1+p2;
    // return min(p1,p2);
    // return max(p1,p2);
}

void UPDATE(ll node,ll b,ll e,ll s,ll newval)
{
    if(s>e || s<b)
        return;
    if(b>=s && e<=s)
    {

        TREE[node] = newval;
        return;

    }
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    UPDATE(LEFT,b,mid,s,newval);
    UPDATE(RIGHT,mid+1,e,s,newval);
    TREE[node]= TREE[LEFT] + TREE[RIGHT] ;

}

ll ma = 100000000000000,temp;
int main()
{
    ll t;
    in(t);
    _ero(i,1,t)
    {
        ll n,m;
    inn(n,m);
    _ero(i,1,n)
    cin>>arr[i];
    init(1,1,n);
    cout<<"Case "<<i<<":\n";

    _er(i,0,m)
    {
        ll a,b;
        inn(a,b);
        cout<<QUERY(1,1,n,a,b)<<endl;
        UPDATE(1,1,n,2,0);
        cout<<QUERY(1,1,n,a,b)<<endl;
    }

    }

    return 0;
}
*/
/*
                                     LAZY PROPAGTION :
ll arr[1000];
struct info
{
    ll prop,SUM;
} TREE[5000];
void init(ll node,ll b,ll e)
{
    if(b==e)
    {
        TREE[node].SUM=arr[b];
        return;
    }
    ll LEFT = node * 2;
    ll RIGHT = node *2 +1;
    ll mid = (b+e)/2;
    init(LEFT,b,mid);
    init(RIGHT,mid+1,e);
    TREE[node].SUM = TREE[LEFT].SUM + TREE[RIGHT].SUM;
    //TREE[node].SUM = min(TREE[LEFT].SUM,TREE[RIGHT].SUM);
  // TREE[node].SUM = max(TREE[LEFT].SUM,TREE[RIGHT].SUM);
}
void UPDATE(ll node,ll b,ll e,ll s,ll d,ll x)
{
    if(s>e || d<b)
        return;
    if(b>=s && e<=d)
    {
        TREE[node].SUM += ((e-b+1)*x);
        TREE[node].prop+=x;
        return;
    }
    ll LEFT = node *2;
    ll RIGHT = node * 2 + 1;
    ll mid = (b+e)/2;
    UPDATE(LEFT,b,mid,s,d,x);
    UPDATE(RIGHT,mid+1,e,s,d,x);
    TREE[node].SUM = TREE[LEFT].SUM + TREE[RIGHT].SUM + (e-b+1)*TREE[node].prop;

}
ll QUERY(ll node,ll b,ll e, ll s,ll d,ll carry)
{
    if(s>e || d<b)
    {
         return 0;
        // return INT_MAX;
         //return INT_MIN;
    }

    if(b>=s && e<=d)
        return TREE[node].SUM + carry * (e-b+1);
    ll LEFT = node << 1;
    ll RIGHT = (node << 1) + 1;
    ll mid = (b + e) >> 1;
    ll p1 = QUERY(LEFT,b,mid,s,d,carry + TREE[node].prop);
    ll p2 = QUERY(RIGHT,mid+1,e,s,d,carry + TREE[node].prop);
    return p1+p2;
   // return max(p1,p2);
   // return min(p1,p2);
}
*/

int main()
{
   fast;
   ll t;
   cin>>t;
   while(t--)
   {
       ll n,s=0;
       in(n);
     ll arr[n+2];
     _ero(i,1,n)
     {
          cin>>arr[i];
          if(s==0)
          {
               if(arr[i]%2==0)
            s=i;
          }

     }

     if(n==1 && arr[1]%2!=0)
        cout<<-1<<endl;
     else if(s>0)
     {
         cout<<1<<endl;
         cout<<s<<endl;

     }
     else
     {
         cout<<2<<endl;
        cout<<1<<" "<<2<<endl;
     }

   }
    return 0;
}


#include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int t,n,sum;
int a[40010],b[40010];
int main(){
    cin>>t;
    while (t--){
        cin>>n;
        for (int i=0;i<n;i++) cin>>a[i];
        if (n==1 && a[0]%2==1){
            cout<<-1<<endl;continue;
        }
        if (a[0]%2==0){
            cout<<1<<endl<<1<<endl;continue;
        }
        if (a[1]%2==0){
            cout<<1<<endl<<2<<endl;continue;
        }
        cout<<2<<endl<<1<<" "<<2<<endl;continue;
    }
}


#include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int t,n,sum;
int a[10010];
int main(){
    cin>>t;
    while (t--){
        cin>>n;
        for (int i=0;i<n;i++) cin>>a[i];
        if (n==1 && a[0]%2==1){
            cout<<-1<<endl;continue;
        }
        if (a[0]%2==0){
            cout<<1<<endl<<1<<endl;continue;
        }
        if (a[1]%2==0){
            cout<<1<<endl<<2<<endl;continue;
        }
        cout<<1<<endl<<1<<" "<<2<<endl;continue;
    }
}


#include<bits/stdc++.h>
using namespace std;
int a[105],b[3];
int main(){
	int n1,n2,ji=0;
	scanf("%d",&n1);
	for(int i=1;i<=n1;i++){
		scanf("%d",&n2);
		for(int j=1;j<=n2;j++){
			scanf("%d",&a[j]);
		}
		for(int h=1;h<=n2;h++){
			if(n2>1){
				if(a[h]%2==0){
					printf("1\n");
					printf("%d\n",h);
					break;
				}else{
					ji++;
					if(ji==2){
						printf("2\n");
						printf("1 2\n");
						break;
					}
				}

			}else{
				if(a[1]%2==0){
					printf("1\n");
					printf("1\n");
				}else{
					printf("-1\n");
				}
			}
		}
		ji=0;
	}
	return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main (){
	int t;
	int n;
	//freopen("bod.in","r",stdin);
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		int a[105];
		bool check=0;
		int sum[105];
		memset(sum, 0, sizeof(sum));
		int s=0;
		for(int i=0;i<n;i++){
			scanf("%d",&a[i]);
			s+=a[i];
			sum[i]=s;
			if(sum[i]%2==0){
				printf("%d\n",i+1);
				for(int j=1;j<=i+1;j++){
					printf("%d ",j);
				}
				printf("\n");
				check=1;
				break;
			}
			/*for(int j=0;j<i;j++){
				if((sum[i]-sum[j])%2==0){
					for(int k)
				}
			}*/
		}
		if(s%2==1&&check==0){
			printf("-1\n");
		}
	}
}


#include <bits/stdc++.h>
using namespace std;
int main (){
	int t;
	int n;
	freopen("bod.in","r",stdin);
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		int a[105];
		bool check=0;
		int sum[105];
		memset(sum, 0, sizeof(sum));
		int s=0;
		for(int i=0;i<n;i++){
			scanf("%d",&a[i]);
			s+=a[i];
			sum[i]=s;
			if(sum[i]%2==0&&check==0){
				printf("%d\n",i+1);
				for(int j=1;j<=i+1;j++){
					printf("%d ",j);
				}
				printf("\n");
				check=1;
				break;
			}
			if(check==0){
			for(int j=0;j<i;j++){
				if((sum[i]-sum[j])%2==0){
					printf("%d\n",i-j);
					for(int q=j+2;q<=i+1;q++){
						printf("%d ",q);
					}
					check=1;
					printf("\n");
					break;
				}
			}
		}
		}
		if(s%2==1&&check==0){
			printf("-1\n");
		}
	}
}


#include <bits/stdc++.h>
using namespace std;
int main (){
	int t;
	int n;
	//freopen("bod.in","r",stdin);
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		int a[105];
		int sum[105];
		memset(sum, 0, sizeof(sum));
		int s=0;
		for(int i=0;i<n;i++){
			scanf("%d",&a[i]);
			s+=a[i];
			sum[i]=s;
			if(sum[i]%2==0){
				printf("%d\n",i+1);
				for(int j=1;j<=i+1;j++){
					printf("%d ",j);
				}
				printf("\n");
				break;
			}
		}
		if(s%2==1){
			printf("-1\n");
		}
	}
}


#include <bits/stdc++.h>
using namespace std;
int main (){
	int t;
	int n;
	//freopen("bod.in","r",stdin);
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		int a[105];
		bool check=0;
		int sum[105];
		memset(sum, 0, sizeof(sum));
		int s=0;
		for(int i=0;i<n;i++){
			scanf("%d",&a[i]);
			s+=a[i];
			sum[i]=s;
			if(sum[i]%2==0&&check==0){
				printf("%d\n",i+1);
				for(int j=1;j<=i+1;j++){
					printf("%d ",j);
				}
				printf("\n");
				check=1;
				break;
			}
			if(check==0){
			for(int j=0;j<i;j++){
				if((sum[i]-sum[j])%2==0){
					printf("%d\n",i-j);
					for(int q=j+2;q<=i+1;q++){
						printf("%d ",q);
					}
					check=1;
					printf("\n");
					break;
				}
			}
		}
		}
		if(s%2==1&&check==0){
			printf("-1\n");
		}
	}
}


#include <bits/stdc++.h>
using namespace std;
long long a,b,c,d,ans,d1,d2;
int main()
{
	cin>>a;
	for(int j=0;j<a;j++)
	{
		d=0;
		ans=0;
		d1=0;
		d2=0;
		cin>>b;
		for(int i=1;i<=b;i++)
		{
		cin>>c;
		d+=c;
		if(c%2==0&&ans==0)
		ans=c;
		if(d%2==1&&d1==0)
		d1=i;
		else if(d%2==0&&d2==0)
		d2=i;
	}
	if(ans!=0)
	{
	cout<<1<<endl;
	cout<<ans<<endl;
}
	else if(d1!=0&&d2!=0)
	{
		cout<<d2-d1+1<<endl;
		for(int i=d1;i<=d2;i++)
		cout<<i<<" ";
		cout<<endl;
	}
	else
	cout<<-1<<endl;
	}
	return 0;
}


#include <bits/stdc++.h>
using namespace std;
long long a,b,c,d,ans,d1,d2;
int main()
{
	cin>>a;
	for(int j=0;j<a;j++)
	{
		d=0;
		ans=0;
		d1=0;
		d2=0;
		cin>>b;
		for(int i=1;i<=b;i++)
		{
		cin>>c;
		d+=c;
		if(c%2==0&&ans!=0)
		ans=c;
		if(d%2==1&&d1==0)
		d1=i;
		else if(d%2==0&&d2==0)
		d2=i;
	}
	if(ans!=0)
	{
	cout<<1<<endl;
	cout<<ans<<endl;
}
	else if(d1!=0&&d2!=0)
	{
		cout<<d2-d1+1<<endl;
		for(int i=d1;i<=d2;i++)
		cout<<i<<" ";
		cout<<endl;
	}
	else
	cout<<-1<<endl;
	}
	return 0;
}


#include <bits/stdc++.h>
using namespace std;
long long a,b,c,d,ans,d1,d2,cf;
int main()
{
	cin>>a;
	for(int j=0;j<a;j++)
	{
		d=0;
		ans=0;
		d1=0;
		d2=0;
		cin>>b;
		for(int i=1;i<=b;i++)
		{
		cin>>c;
		d+=c;
		if(c%2==0&&ans==0)
		ans=i;
		if(d%2==1&&d1==0)
		d1=i;
		else if(d%2==0&&d2==0)
		d2=i;
	}
	if(ans!=0)
	{
	cout<<1<<endl;
	cout<<ans<<endl;
}
	else if(d1!=0&&d2!=0)
	{
		cout<<d2-d1+1<<endl;
		for(int i=d1;i<=d2;i++)
		cout<<i<<" ";
		cout<<endl;
	}
	else
	cout<<-1<<endl;
	}
	return 0;
}


#include <bits/stdc++.h>
using namespace std;
long long a,b,c,d,maxans;
int main()
{
	cin>>a;
	for(int i=0;i<a;i++)
	{
		d=0;
		cin>>b>>maxans;
		for(int j=0;j<b;j++)
		{
			cin>>c;
			d+=c;
		}
		cout<<min(maxans,d)<<endl;
	}
	return 0;
}


#include <bits/stdc++.h>
using namespace std;
long long a,b,c,d,ans,d1,d2;
int main()
{
	cin>>a;
	for(int j=0;j<a;j++)
	{
		d=0;
		ans=0;
		d1=0;
		d2=0;
		cin>>b;
		for(int i=1;i<=b;i++)
		{
		cin>>c;
		d+=c;
		if(c%2==0&&ans!=0)
		ans=c;
		if(d%2==1&&d1==0)
		d1=i;
		else if(d%2==0&&d2==0)
		d2=i;
	}
	if(ans!=0)
	cout<<ans<<endl;
	else if(d1!=0&&d2!=0)
	{
		for(int i=d1;i<=d2;i++)
		cout<<i<<" ";
		cout<<endl;
	}
	else
	cout<<-1<<endl;
	}
	return 0;
}


#include <bits/stdc++.h>
using namespace std;
long long a,b,c,d,ans,d1,d2;
int main()
{
	cin>>a;
	for(int j=0;j<a;j++)
	{
		d=0;
		ans=0;
		d1=0;
		d2=0;
		cin>>b;
		for(int i=1;i<=b;i++)
		{
		cin>>c;
		d+=c;
		if(c%2==0&&ans==0)
		ans=i;
		if(d%2==1&&d1==0)
		d1=i;
		else if(d%2==0&&d2==0)
		d2=i;
	}
	if(ans!=0)
	{
	cout<<1<<endl;
	cout<<ans<<endl;
}
	else if(d1!=0&&d2!=0)
	{
		cout<<d2-d1+1<<endl;
		for(int i=d1;i<=d2;i++)
		cout<<i<<" ";
		cout<<endl;
	}
	else
	cout<<-1<<endl;
	}
	return 0;
}


#include<iostream>
int main(){
    using namespace std;
    int t;
    cin >> t;
    while(t--){
        int n,x,c=0,i;
        cin >> n;
        int a[n];
        for(i=0;i<n;i++)
            cin >> a[i];
        for(i=0;i<n;i++){
            if(a[i]%2==0){
                c++;
                x=a[i];
            }
            }
            if(c!=0){
                cout<< "1" << endl << 2 << endl;
            }
            else if(n>=2){
                cout << "2" << endl;
                cout << "1" << " "<< "2" << endl;
            }
        else
            cout << "-1" << endl;
    }
    return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define IOS                       \
    ios_base::sync_with_stdio(0); \
    cin.tie(NULL);                \
    cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define Debug(x) cout << #x " = " << (x) << endl
#define SORT(a) sort(a.begin(), a.end())
#define SORTR(a) sort(a.rbegin(), a.rend())
#define mod 1000000007

void solve()
{
    int n, q = 0;
    cin >> n;

    vector<int> odd;
    vector<int> even;

    for (int i = 0; i < n; i++)
    {
        int x;
        cin >> x;

        if (x % 2 == 0)
            even.pb((i + 1));

        else
            odd.pb((i + 1));
    }

    if (odd.size() % 2 != 0)
        odd.pop_back();
    q = even.size() + (odd.size());

    if (q <= 0)
        cout << -1 << endl;
    else
    {
        cout << q << endl;
        for (int i = 0; i < even.size(); i++)
            cout << even[i] << " ";

        for (int i = 0; i < odd.size(); i += 2)
            cout << odd[i] << " " << odd[i + 1] << " ";
        cout << endl;
    }
}

int main()
{
    IOS;

    int t;
    cin >> t;

    while (t--)
    {
        solve();
    }

    return 0;
}


#include<iostream>
int main(){
    using namespace std;
    int t;
    cin >> t;
    while(t--){
        int n,x,c=0,i;
        cin >> n;
        int a[n];
        for(i=0;i<n;i++)
            cin >> a[i];
        for(i=0;i<n;i++){
            if(a[i]%2==0){
                c++;
                x=a[i];
            }
            }
            if(c!=0){
                cout<< "1" << endl << 2 << endl;
            }
            else if(n>=2){
                cout << "2" << endl;
                cout << a[1] << " "<< a[0] << endl;
            }
        else
            cout << "-1" << endl;
    }
    return 0;
}


#include<iostream>
int main(){
    using namespace std;
    int t;
    cin >> t;
    while(t--){
        int n,x,c=0,i;
        cin >> n;
        int a[n];
        for(i=0;i<n;i++)
            cin >> a[i];
        for(i=0;i<n;i++){
            if(a[i]%2==0){
                c++;
                x=a[i];
            }
            }
            if(c!=0){
                cout<< "1" << endl << x << endl;
            }
            else if(n>=2){
                cout << "2" << endl;
                cout << a[1] << " "<< a[0] << endl;
            }
        else
            cout << "-1" << endl;
    }
    return 0;
}


#include<iostream>
#include<vector>
using namespace std;

const int Len = 1e6 + 5;

int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    //freopen("A.txt","r",stdin);
    int t;
    cin >> t;
    while(t --)
    {
        int n;
        cin >> n;
        int ar[n + 5];
        for(int i = 1; i <= n; i ++) cin >> ar[i];
        if(ar[1] & 1)
        {
            if(n < 2) cout << -1 << endl;
            else if(ar[2] & 1)  cout << 2 << endl << 1 << ' ' << 2 << endl;
            else cout << 1 << endl << 2 << endl;
        }
        else
            cout << 1 << endl << 1 << endl;
    }
    return 0;
}


#include<iostream>
#include<vector>
using namespace std;

const int Len = 1e6 + 5;

int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    //freopen("A.txt","r",stdin);
    int t;
    cin >> t;
    while(t --)
    {
        int n;
        cin >> n;
        vector<int> even, odd;
        int val;
        for(int i = 1; i <= n; i ++)
        {
            cin >> val;
            if(val % 2 == 0)
            {
                even.push_back(i);
            }
            else
            {
                odd.push_back(i);
            }
        }
        if(even.size())
        {
            cout << 1 << endl << even.front() << endl;
        }
        else if(odd.size() && odd.size() % 2 == 0)
        {
            cout << 2 << endl;
            for(int i = 0; i < 2; i ++)
                cout << odd[i] << " ";
            cout << endl;
        }
        else
            cout << -1 << endl;
    }
    return 0;
}


#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<map>
#include<vector>
using namespace std;

int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    //freopen("A.txt","r",stdin);
    int t;
    cin >> t;
    while(t --)
    {
        int n, ar[1005];
        cin >> n;
        int have_even = 0, even, even_place;
        int cnt_odd = 0;
        for(int i = 1; i <= n; i ++)
        {
            cin >> ar[i];
            if(ar[i] % 2 == 0 && ! have_even)
                have_even = 1, even_place = i;
            else
                cnt_odd ++;
        }

        if(have_even)
        {
            cout << 1 << endl << even_place << endl;
        }
        else if(cnt_odd && cnt_odd % 2 == 0)
        {
            cout << 2 << endl;
            int cnt_odd = 2;
            for(int i = 1; i <= n; i ++)
            {
                if(ar[i] % 2 != 0 && cnt_odd)
                {
                    cout << i << " ";
                    cnt_odd --;
                }
                if(! cnt_odd)
                {
                    cout << endl;
                    break;
                }
            }
        }
        else
            cout << -1 << endl;
    }

    return 0;
}


#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<map>
#include<vector>
using namespace std;

int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    //freopen("A.txt","r",stdin);
    int t;
    cin >> t;
    while(t --)
    {
        int n, ar[1005];
        cin >> n;
        int have_even = 0, even, even_place;
        int cnt_odd = 0;
        for(int i = 1; i <= n; i ++)
        {
            cin >> ar[i];
            if(ar[i] % 2 == 0 && ! have_even)
                have_even = 1, even_place = i;
            else if(ar[i] % 2 != 0)
                cnt_odd ++;
        }

        if(have_even)
        {
            cout << 1 << endl << even_place << endl;
        }
        else if(cnt_odd && cnt_odd % 2 == 0)
        {
            cout << 2 << endl;
            int cnt_odd = 2;
            for(int i = 1; i <= n; i ++)
            {
                if(ar[i] % 2 != 0 && cnt_odd)
                {
                    cout << i << " ";
                    cnt_odd --;
                }
                if(! cnt_odd)
                {
                    cout << endl;
                    break;
                }
            }
        }
        else
            cout << -1 << endl;
    }

    return 0;
}


#include<iostream>
#include<vector>
using namespace std;

const int Len = 1e6 + 5;

int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    //freopen("A.txt","r",stdin);
    int t;
    cin >> t;
    while(t --)
    {
        int n;
        cin >> n;
        vector<int> even, odd;
        int val;
        for(int i = 1; i <= n; i ++)
        {
            cin >> val;
            if(val % 2 == 0)
            {
                even.push_back(i);
            }
            else
            {
                odd.push_back(i);
            }
        }
        if(even.size())
        {
            cout << 1 << endl << even.front() << endl;
        }
        else if(odd.size() && odd.size() % 2 == 0)
        {
            cout << 2 << endl;
            cout << odd[0] << " " << odd[1] << endl;
        }
        else
            cout << -1 << endl;
    }
    return 0;
}


#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<map>
#include<vector>
using namespace std;

int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    freopen("A.txt","r",stdin);
    int t;
    cin >> t;
    while(t --)
    {
        int n, ar[1005];
        cin >> n;
        int have_even = 0, even, even_place;
        int cnt_odd = 0;
        for(int i = 1; i <= n; i ++)
        {
            cin >> ar[i];
            if(ar[i] % 2 == 0)
                have_even = 1, even_place = i;
            else if(ar[i] % 2 != 0)
                cnt_odd ++;
        }

        if(have_even)
        {
            cout << 1 << endl << even_place << endl;
        }
        else if(cnt_odd && cnt_odd % 2 == 0)
        {
            cout << 2 << endl;
            int cnt_odd = 2;
            for(int i = 1; i <= n; i ++)
            {
                if(ar[i] % 2 != 0 && cnt_odd)
                {
                    cout << i << " ";
                    cnt_odd --;
                }
                if(! cnt_odd)
                {
                    cout << endl;
                    break;
                }
            }
        }
        else
            cout << -1 << endl;
    }

    return 0;
}


#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<map>
#include<vector>
using namespace std;

int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    //freopen("A.txt","r",stdin);
    int t;
    cin >> t;
    while(t --)
    {
        int n, ar[1005];
        cin >> n;
        int have_even = 0, even, even_place;
        int cnt_odd = 0;
        for(int i = 1; i <= n; i ++)
        {
            cin >> ar[i];
            if(ar[i] % 2 == 0)
                have_even = 1, even_place = i;
            else if(ar[i] % 2 != 0)
                cnt_odd ++;
        }

        if(have_even)
        {
            cout << 1 << endl << even_place << endl;
        }
        else if(cnt_odd && cnt_odd % 2 == 0)
        {
            cout << 2 << endl;
            int cnt_odd = 2;
            for(int i = 1; i <= n; i ++)
            {
                if(ar[i] % 2 != 0 && cnt_odd)
                {
                    cout << i << " ";
                    cnt_odd --;
                }
                if(! cnt_odd)
                {
                    cout << endl;
                    break;
                }
            }
        }
        else
            cout << -1 << endl;
    }

    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    for (int aa=0;aa<n;aa++) {
        int a;
        cin >> a;
        int check1=-1,check2=-1;
        int ans=0;
        if (a==1) {int c;cin >> c;if (c%2==0) cout << "1" << endl << "1" << endl; else cout << "-1" << endl;}
        else {
        int b[a];
        for (int i=0;i<a;i++) {
            cin >> b[i];
            if (b[i]%2==0 && ans==0) {cout << "1" << endl << i+1 << endl;ans++;}
            else if (check1==-1) check1=i+1;
            else if (check2==-1) check2=i+1;
        }
        if (ans!=1) cout << "2" << endl << check1 << " " << check2 << endl;
        }
    }
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    for (int aa=0;aa<n;aa++) {
        int a;
        cin >> a;
        int check1=-1;
        int ans=0;
        if (a==1) {int c;cin >> c;if (c%2==0) cout << "1" << endl; else cout << "-1" << endl;}
        else {
        int b[a];
        for (int i=0;i<a;i++) {
            cin << b[i];
            if (b[i]%2==0 && ans==0) {cout << i+1 << endl;ans++;}
            else if (check1==-1) check1=i+1;
            else if (check2==-1) check2=i+1;
        }
        }
        if (ans!=1) cout << check1 << " " << check2 << endl;
    }
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    for (int aa=0;aa<n;aa++) {
        int a;
        cin >> a;
        int check1=-1,check2=-1;
        int ans=0;
        if (a==1) {int c;cin >> c;if (c%2==0) cout << "1" << endl; else cout << "-1" << endl;}
        else {
        int b[a];
        for (int i=0;i<a;i++) {
            cin >> b[i];
            if (b[i]%2==0 && ans==0) {cout << i+1 << endl;ans++;}
            else if (check1==-1) check1=i+1;
            else if (check2==-1) check2=i+1;
        }
        }
        if (ans!=1) cout << check1 << " " << check2 << endl;
    }
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    for (int aa=0;aa<n;aa++) {
        int a;
        cin >> a;
        int check1=-1,check2=-1;
        int ans=0;
        if (a==1) {int c;cin >> c;if (c%2==0) cout << "1" << endl; else cout << "-1" << endl;}
        else {
        int b[a];
        for (int i=0;i<a;i++) {
            cin >> b[i];
            if (b[i]%2==0 && ans==0) {cout << i+1 << endl;ans++;}
            else if (check1==-1) check1=i+1;
            else if (check2==-1) check2=i+1;
        }
        if (ans!=1) cout << check1 << " " << check2 << endl;
        }
    }
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    for (int aa=0;aa<n;aa++) {
        int a;
        cin >> a;
        int check1=-1;
        int ans=0;
        if (a==1) {int c;cin >> c;if (c%2==0) cout << "1" << endl; else cout << "-1" << endl;}
        else {
        int b[a];
        for (int i=0;i<a;i++) {
            cin >> b[i];
            if (b[i]%2==0 && ans==0) {cout << i+1 << endl;ans++;}
            else if (check1==-1) check1=i+1;
            else if (check2==-1) check2=i+1;
        }
        }
        if (ans!=1) cout << check1 << " " << check2 << endl;
    }
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main(){
	int i,t,n,sum_ev,sum_od;
	scanf("%d",&t);
	while(t--){
		cin>>n;
		int k,j,a[n],even[n],odd[n];

		sum_ev = sum_od = 0;
		j=k=0;
		for(i=0;i<n;i++){
			cin>>a[i];
		}
		if(n==1 && n%2==0){
			cout<<-1<<endl;
			continue;
		}
		else if(n==1 && n%2!=0) {
		cout<<-1<<endl;
		continue;
	}

			for(i=0;i<n;i++){
			if(a[i]%2==0){
				sum_ev += a[i];
				even[j++]=i+1;
			}

			else if(a[i]%2!=0){
				sum_od += a[i];
				odd[k++] =i+1;
			}
			//k++;j++;
		//cout<<sum_ev<<endl<<sum_od<<endl;
		int cn=0;
		if(sum_od%2==0 && sum_od !=0){
			cout<<k<<endl;
			//cout<<"odd"<<endl;
			while(k--){
				cout<<odd[cn++]<<" ";
			}
			cout<<endl;
			break;
		}

		else if(sum_ev%2==0 && sum_ev!=0){
			cout<<j<<endl;
			//cout<<"ev"<<endl;
			while(j--){
				cout<<even[cn++]<<" ";
			}
			cout<<endl;
			break;
		}
	}

	}

}


#include<bits/stdc++.h>
using namespace std;
int main(){
	int i,t,n,sum_ev,sum_od;
	scanf("%d",&t);
	while(t--){
		cin>>n;
		int k,j,a[n],even[n],odd[n];

		sum_ev = sum_od = 0;
		j=k=0;
		for(i=0;i<n;i++){
			cin>>a[i];
		}
		if(n==1 && n%2==0){
			cout<<-1<<endl;
			continue;
		}
		else if(n==1 && n%2!=0) {
		cout<<-1<<endl;
		continue;
	}

			i=0;
				if(a[i]%2==0){
				cout<<1<<endl<<i+1<<endl;
			}
			else if(a[i+1]%2==0){
				cout<<1<<endl<<i+2<<endl;
			}
			else{
				cout<<2<<endl<<1<<" "<<2<<endl;
			}
	}

}


#include<bits/stdc++.h>
using namespace std;
int main(){
	int i,t,n,sum_ev,sum_od;
	scanf("%d",&t);
	while(t--){
		cin>>n;
		int k,j,a[n];

		for(i=0;i<n;i++){
			cin>>a[i];
		}

		if(n==1 && a[0]%2==0){
			cout<<1<<endl<<1<<endl;
			continue;
		}
		else if(n==1 && a[0]%2!=0) {
		cout<<-1<<endl;
		continue;
			}

			i=0;
				if(a[i]%2==0){
				cout<<1<<endl<<i+1<<endl;
			}
			else if(a[i+1]%2==0){
				cout<<1<<endl<<i+2<<endl;
			}
			else{
				cout<<2<<endl<<1<<" "<<2<<endl;
			}
	}

}


#include<bits/stdc++.h>
using namespace std;
int main(){
	int i,t,n,sum_ev,sum_od;
	scanf("%d",&t);
	while(t--){
		cin>>n;
		int k,j,a[n],even[n],odd[n];

		sum_ev = sum_od = 0;
		j=k=0;
		for(i=0;i<n;i++){
			cin>>a[i];
		}
		if(n==1 && n%2==0){
			cout<<1<<endl;
			continue;
		}
		else if(n==1 && n%2!=0) {
		cout<<-1<<endl;
		continue;
	}

			i=0;
				if(a[i]%2==0){
				cout<<1<<endl<<i+1<<endl;
			}
			else if(a[i+1]%2==0){
				cout<<1<<endl<<i+2<<endl;
			}
			else{
				cout<<2<<endl<<1<<" "<<2<<endl;
			}
	}

}


#include<bits/stdc++.h>
using namespace std;
int main(){
	int i,t,n,sum_ev,sum_od;
	scanf("%d",&t);
	while(t--){
		cin>>n;
		int k,j,a[n],even[n],odd[n];

		sum_ev = sum_od = 0;
		j=k=0;
		for(i=0;i<n;i++){
			cin>>a[i];
		}
		if(n==1 && a[0]%2==0){
			cout<<1<<endl;
			continue;
		}
		else if(n==1 && a[0]%2!=0) {
		cout<<-1<<endl;
		continue;
	}

			i=0;
				if(a[i]%2==0){
				cout<<1<<endl<<i+1<<endl;
			}
			else if(a[i+1]%2==0){
				cout<<1<<endl<<i+2<<endl;
			}
			else{
				cout<<2<<endl<<1<<" "<<2<<endl;
			}
	}

}


#include<cstdio>
int n,T,sum,flg,a[233];
int main(){
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		flg=0;
	    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	    for(int i=1;i<=n;i++){
			if(a[i]%2&&flg==0)flg=i;
			else if(a[i]%2&&flg>0){printf("2\n%d %d\n",flg,i);goto end;}
			else {printf("1\n%d\n",i);goto end;}
		}
		puts("-1");
		end:;
	}
}


#include<cstdio>
int n,T,sum,flg,a;
int main(){
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		flg=0;
		for(int i=1;i<=n;i++){
			scanf("%d",&a);
			if((a&1)&&flg==0)flg=i;
			else if((a&1)&&flg>0){printf("2\n%d %d\n",flg,i);goto end;}
			else if(a&1==0){printf("1\n%d\n",i);goto end;}
		}
		puts("-1");
		end:;
	}
}


#include<cstdio>
int n,T,sum,flg,a[233];
int main(){
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		flg=0;
	    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	    for(int i=1;i<=n;i++){
			if(a[i]%2&&flg==0)flg=i;
			else if(a[i]%2&&flg>0){printf("2\n%d %d\n",flg,i);goto end;}
			else if(a[i]&1==0){printf("1\n%d\n",i);goto end;}
		}
		puts("-1");
		end:;
	}
}


#include <bits/stdc++.h>

using namespace std;

int n, a[110], t;

int main() {
	cin >> t;
	while(t--) {
		cin >> n;
		int s = 0;
		for(register int i = 1; i <= n; i++) cin >> a[i], s += a[i];
		if(s % 2 == 0) {
			cout << n << endl;
			for(register int i = 1; i <= n; i++) cout << i << " " ;
			cout << endl;
		} else {
			if(n == 1) {
				puts("-1");
				continue ;
			}
			int flag = 0;
			for(register int i = 1; i <= n; i++) {
				if(a[i] & 1) {
					flag = i;
					break;
				}
			}
			if(flag) {
				cout << 1 << endl;
				cout << flag << endl;
			} else puts("-1");
		}
	}
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

int n, a[110], t;

int main() {
	cin >> t;
	while(t--) {
		cin >> n;
		for(register int i = 1; i <= n; i++) cin >> a[i];
		int flag = 0;
		for(register int i = 1; i <= n; i++) {
			if(a[i] % 2 == 0) {
				flag = 1;
				cout << 1 << endl;
				cout << i << endl;
			}
		}
		if(flag) {
			continue ;
		}
		int flag2 = 0;
		for(register int i = 1; i <= n; i++) {
			if(a[i] & 1) {
				if(!flag) flag = i;
				else {
					cout << 2 << endl;
					cout << flag << " " << i << endl;
					flag2 = 1;
					break;
				}
			}
		}
		if(!flag2) {
			puts("-1");
		}
	}
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

int n, a[110], t;

int main() {
	cin >> t;
	while(t--) {
		cin >> n;
		for(register int i = 1; i <= n; i++) cin >> a[i];
		int flag = 0;
		for(register int i = 1; i <= n; i++) {
			if(a[i] % 2 == 0) {
				flag = 1;
				cout << 1 << endl;
				cout << i << endl;
			}
		}
		if(flag) {
			continue ;
		}
		int flag2 = 0;
		for(register int i = 1; i <= n; i++) {
			if(a[i] & 1) {
				if(!flag) flag = i;
				else {
					cout << 2 << endl;
					cout << flag << " " << i << endl;
					flag2 = 1;
				}
			}
		}
		if(!flag2) {
			puts("-1");
		}
	}
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

int n, a[110], t;

int main() {
	cin >> t;
	while(t--) {
		cin >> n;
		int s = 0;
		for(register int i = 1; i <= n; i++) cin >> a[i], s += a[i];
		if(s % 2 == 0) {
			cout << n << endl;
			for(register int i = 1; i <= n; i++) cout << i << " " ;
			cout << endl;
		} else {
			if(n == 1) {
				puts("-1");
				continue ;
			}
			int flag = 0;
			for(register int i = 1; i <= n; i++) {
				if(a[i] & 1) {
					flag = i;
					break;
				}
			}
			if(flag) {
				cout << n - 1 << endl;
				for(register int i = 1; i <= n; i++) {
					if(i == flag) continue ;
					cout << a[i] << " ";
				}
				cout << endl;
			} else puts("-1");
		}
	}
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

int n, a[110], t;

int main() {
	cin >> t;
	while(t--) {
		cin >> n;
		int s = 0;
		for(register int i = 1; i <= n; i++) cin >> a[i], s += a[i];
		if(s % 2 == 0) {
			cout << n << endl;
			for(register int i = 1; i <= n; i++) cout << i << " " ;
			cout << endl;
		} else {
			if(n == 1) {
				puts("-1");
				continue ;
			}
			int flag = 0;
			for(register int i = 1; i <= n; i++) {
				if(a[i] & 1) {
					flag = i;
					break;
				}
			}
			if(flag) {
				cout << n - 1 << endl;
				for(register int i = 1; i <= n; i++) {
					if(i == flag) continue ;
					cout << i << " ";
				}
				cout << endl;
			} else puts("-1");
		}
	}
	return 0;
}


#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int mxN = 1e5;
int dp[mxN];

int main(){
int t; cin >> t;
while(t--){
 int n; cin >> n;
 int arr[n+1];
 for(int i =0; i<n; i++) cin >> arr[i];
 dp[0] = 0;
 for(int i =1; i<n; i++){
  dp[i] = i;
  if( arr[dp[i-1]] % 2 == 0 ) dp[i] = dp[i-1];
  if( arr[i] % 2 == 0 ) dp[i] = i;
 }
 if( n == 1 && arr[0] % 2 == 0){
   cout<<"1"<<endl;
   cout<<"1"<<endl;
 }else if( n == 1 && arr[0] % 2 != 0){
   cout<<"-1"<<endl;
 }else if( arr[dp[n-1]] % 2 == 0){
  cout<<"1"<<endl;
  cout<<dp[n-1]+1<<endl;
 }else{
  cout<<"2"<<endl;
  cout<<"1"<<" "<<dp[n-1]+1<<endl;
 }
}
return 0;
}


#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int mxN = 1e5;
int dp[mxN];

int main(){
int t; cin >> t;
while(t--){
 int n; cin >> n;
 int arr[n+1];
 for(int i =0; i<n; i++) cin >> arr[i];
 for(int i =1; i < n; i++){
   if( (arr[0] + arr[i]) % 2 == 0 ){
    cout<<"2"<<endl;
    cout<<1<<" "<<i+1<<endl;
    break;
   }
   if( arr[i] % 2 == 0 ){
    cout<<"1"<<endl;
    cout<<i+1<<endl;
    break;
   }
 }
 if( n == 1 && arr[0] % 2 != 0) cout<<"-1"<<endl;
}
return 0;
}


#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int mxN = 1e5;
int dp[mxN];

int main(){
int t; cin >> t;
while(t--){
 int n; cin >> n;
 int arr[n+1];
 for(int i =0; i<n; i++) cin >> arr[i];
 dp[0] = 0;
 for(int i =1; i<n; i++){
  dp[i] = i;
  if( arr[dp[i-1]] % 2 == 0 ) dp[i] = dp[i-1];
  if( arr[i] % 2 == 0 ) dp[i] = i;
 }
 if( n == 1 && arr[0] % 2 == 0){
   cout<<"1";
   cout<<"1"<<endl;
 }else if( n == 1 && arr[0] % 2 != 0){
   cout<<"-1"<<endl;
 }else if( arr[dp[n-1]] % 2 == 0){
  cout<<"1"<<endl;
  cout<<dp[n-1]+1<<endl;
 }else{
  cout<<"2"<<endl;
  cout<<"1"<<" "<<dp[n-1]+1<<endl;
 }
}
return 0;
}


#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int mxN = 1e5;
int dp[mxN];

int main(){
int t; cin >> t;
while(t--){
 int n; cin >> n;
 int arr[n+1];
 for(int i =0; i<n; i++) cin >> arr[i];
 for(int i =1; i <n; i++){
   if( (arr[0] + arr[i]) % 2 == 0 ){
    cout<<"2"<<endl;
    cout<<1<<" "<<i+1<<endl;
    break;
   }
   if( arr[i] % 2 == 0 ){
    cout<<"1"<<endl;
    cout<<i+1<<endl;
    break;
   }
 }
 if( n == 1 && arr[0] % 2 == 0){
  cout<<"1"<<endl;
  cout<<"1"<<endl;
 }else if(n == 1 && arr[0] % 2 != 0) cout<<"-1"<<endl;
}
return 0;
}


#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int mxN = 1e5;
int dp[mxN];

int main(){
int t; cin >> t;
while(t--){
 int n; cin >> n;
 int arr[n+1];
 for(int i =0; i<n; i++) cin >> arr[i];
 for(int i =0; i <n; i++){
   if(i){
       if( (arr[0] + arr[i]) % 2 == 0 ){
        cout<<"2"<<endl;
        cout<<1<<" "<<i+1<<endl;
         break;
        }
    }
   if( arr[i] % 2 == 0 ){
    cout<<"1"<<endl;
    cout<<i+1<<endl;
    break;
   }
 }
 if(n == 1 && arr[0] % 2 != 0) cout<<"-1"<<endl;
}
return 0;
}


#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int mxN = 1e5;
int dp[mxN];

int main(){
int t; cin >> t;
while(t--){
 int n; cin >> n;
 int arr[n+1];
 for(int i =0; i<n; i++) cin >> arr[i];
 for(int i =1; i <n; i++){
   if( (arr[0] + arr[i]) % 2 == 0 ){
    cout<<"2"<<endl;
    cout<<1<<" "<<i+1<<endl;
    break;
   }
   if( arr[i] % 2 == 0 ){
    cout<<"1"<<endl;
    cout<<i+1<<endl;
    break;
   }
 }
 if( n == 1 && arr[0] % 2 == 0){
  cout<<"1"<<endl;
  cout<<"1"<<endl;
 }else cout<<"-1"<<endl;
}
return 0;
}


#include<bits/stdc++.h>
#include <iostream>

using namespace std;

int main()
{
    long long int result[100][3],t,n,i,j,k,A[100][2];
    cin>>t;
    for(i=0;i<t;i++){
        cin>>n;
        result[i][0]=0;
        for(j=0;j<n;j++){
            cin>>A[j][0];
            if(A[j][0]%2==0){
                result[i][0]=1;
                result[i][1]=j+1;
                result[i][2]=0;
            }
        }
         if(result[i][0]==0){
                for(j=0;j<n-1;j++){
                    if(A[j][0]%2==1&&A[j+1][0]%2==1){
                        result[i][0]=2;
                        result[i][1]=j+1;
                        result[i][2]=j+2;
                        break;
                    }
                }
            }
       // cout<<result[i][1]<<" "<<result[i][2]<<endl;
    }

    for(i=0;i<t;i++){
        if(result[i][0]==0)
            cout<<-1<<endl;
        else{
            cout<<result[i][0]<<endl;
            if(result[i][2]==0)
                cout<<result[i][1]<<endl;
            else
            cout<<result[i][1]<<" "<<result[i][2]<<endl;
        }
    }
    return 0;
}


#include <iostream>
using namespace std;
int main(){
	int a,c,prev = 0;
	std::cin >> a;
	int was = 0;
	for(int y =0; y != a; y++){
		std::cin >> c;
		int hh = 0;
		//cout << "--"<<c << endl;
		bool p = 0;
		for(int q = 0; q != c; q++){
			std::cin >> hh;
			cout << "c = " << c << " q = " << q << " hh = " << hh << endl;
			if(p) continue;
			//cout << "hh =" << hh << endl;
		      	if(hh % 2 == 0){ std::cout << q + 1 << std::endl; was = 2; p = true;}
			else{
				if(was){std::cout << prev << " " << q + 1 << std::endl;was = 2; p = true;}
				was = 1;
				prev = q + 1;
			}
		}
		if(was != 2) std::cout << -1 << std::endl;
		was = 0;
	}
}


#include <iostream>
using namespace std;
int main(){
	int a,c,prev = 0;
	std::cin >> a;
	int was = 0;
	for(int y =0; y != a; y++){
		std::cin >> c;
		int hh = 0;
		//cout << "--"<<c << endl;
		bool p = 0;
		for(int q = 0; q != c; q++){
			std::cin >> hh;
			//cout << "c = " << c << " q = " << q << " hh = " << hh << endl;
			if(p) continue;
			//cout << "hh =" << hh << endl;
		      	if(hh % 2 == 0){ std::cout << 1 << '\n' << q + 1 << std::endl; was = 2; p = true;}
			else{
				if(was){std::cout << 2 << '\n' << prev <<" " << q + 1 << std::endl;p = true;}
				was++;
				prev = q + 1;
			}
		}
		if(was != 2) std::cout << -1 << std::endl;
		was = 0;
	}
}


#include<iostream>
#include<stdio.h>
#include<string.h>
#include<string>
#include<stdlib.h>

using namespace std;
struct pro
{
	bool x;
	bool y;
	bool z;
}p[1100];

int main()
{
	int n;
	while(cin>>n)
	{
		int total=0;
		for(int i=0;i<n;i++)
		{
			cin>>p[i].x>>p[i].y>>p[i].z;
			int cnt=0;
			if(p[i].x)
			cnt++;
			if(p[i].y)
			cnt++;
			if(p[i].z)
			cnt++;
			if(cnt>=2)
				total++;
		}
		cout<<total<<endl;
	}
	return 0;
}


#include<iostream>
using namespace std;
int main()
{
	int n,t=0;
	cin>>n;
	while(n--)
	{
		int a,b,c;
		cin>>a>>b>>c;
		if(a+b+c>=2)t++;
	}
	cout<<t<<endl;
}


#include<iostream>
#include<cstring>
using namespace std;
int main()
{
	int n;
	int a[1000][3];
	cin>>n;
	while(cin.fail()==0)
	{
		int i,j;
		for(i=0;i<n;i++)
			for(j=0;j<3;j++)
				cin>>a[i][j];
		int sum[1000];
		memset(sum,0,sizeof(sum));
		for(i=0;i<n;i++)
			for(j=0;j<3;j++)
				sum[i]+=a[i][j];
		int k=0;
		for(i=0;i<n;i++)
			if(sum[i]>=2)
				k++;
		cout<<k<<endl;
		cin>>n;
	}
	return 0;
}


#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
	int a;

	while(cin>>a)
	{int sum=0;

int **p;
p = new int*[a];
for(int i=0; i<a;i++)
{
p[i] = new int [3];
}
for(int i=0;i<a;i++)
for(int n=0;n<3;n++)
cin>>p[i][n];

for(int i=0;i<a;i++)
{
	int temp1=0;
for(int n=0;n<3;n++)
{
	temp1+=p[i][n];
}
if(temp1>1)
	sum++;
}
cout<<sum<<endl;
	}

	return 0;
}


#include<iostream>
using namespace std;
int main() {
	int sum=0,n,a,b,c;
	cin>>n;
	while(n--){
		cin>>a>>b>>c;
		if(a+b+c>=2)
				sum++;
	}
	cout<<sum<<endl;
}


#include <vector>
using namespace std;
int main()
{
	int n,cnt;
	bool fir,sec,thir;
	while(cin>>n){
		cnt=0;

		for (int i=0;i!=n;++i){
			cin>>fir>>sec>>thir;
			if ( fir ){
				if (sec){
					cnt++;
				}else if (thir){
					cnt++;
				}
			}else if( sec&&thir ){
				cnt++;
			}
		}
		cout<<cnt<<endl;
	}
	return 0;
}


#include <stdio.h>
int chk(int ans[100],int k){
	int i,n=0;
	for(i=0;i<=k;i++){
		if (ans[i]==1)
			n++;
		}
		return n;
	}
int main(){
	int n,problem=0,i,j,ans[100];

	scanf("%d",&n);
	for(j=0;j<n;j++){

		for(i=0;i<n;i++){
			scanf("%d",&ans[i]);
		}
		if (chk(ans,n)>=2){
			problem++;
		}
	}
	printf("%d",problem);
	return 0;

}


#include <stdio.h>
int chk(int ans[100],int k){
	int i,n=0;
	for(i=0;i<k;i++){
		if (ans[i]==1)
			n++;
		}
		return n;
	}
int main(){
	int n,problem=0,i,j,ans[100],a;

	scanf("%d",&n);
	for(j=0;j<=n;j++){
		a=0;
		for(i=0;i<n;i++){
			scanf("%d",&ans[i]);
			if(ans[i]==1){
				a++;
			}
			else{
				a=a;
			}

		if(a>1){
			problem++;
		}

	}

}
	printf("%d",problem);
	return 0;
}


#include <stdio.h>
int chk(int ans[100],int k){
	int i,n=0;
	for(i=0;i<=k;i++){
		if (ans[i]==1)
			n++;
		}
		return n;
	}
int main(){
	int n,problem=0,i,j,ans[100];

	scanf("%d",&n);
	for(j=0;j<=n;j++){

		for(i=0;i<n;i++){
			scanf("%d",&ans[i]);
		}
		if (chk(ans,n)>=2){
			problem++;
		}
	}
	printf("%d",problem);
	return 0;

}


#include <stdio.h>
int chk(int ans[100],int k){
	int i,n=0;
	for(i=0;i<k;i++){
		if (ans[i]==1)
			n++;
		}
		return n;
	}
int main(){
	int n,problem=0,i,j,ans[100],a;

	scanf("%d",&n);
	for(j=0;j<n;j++){
		a=0;
		for(i=0;i<n;i++){
			scanf("%d",&ans[i]);
			if(ans[i]==1){
				a++;
			}
			else{
				a+=0;
			}

	}

		if(a>1){
			problem++;
		}
		else{
			problem+=0;
		}

}
	printf("%d",problem);
	return 0;
}


#include <stdio.h>
int chk(int ans[100],int k){
	int i,n=0;
	for(i=0;i<k;i++){
		if (ans[i]==1)
			n++;
		}
		return n;
	}
int main(){
	int n,problem=0,i,j,ans[100];

	scanf("%d",&n);
	for(j=0;j<n;j++){

		for(i=0;i<n;i++){
			scanf("%d",&ans[i]);
		}
		if (chk(ans,n)>1){
			problem++;
		}
	}
	printf("%d",problem);
	return 0;

}


#include <stdio.h>
int chk(int ans[100],int k){
	int i,n=0;
	for(i=0;i<3;i++){
		if (ans[i]==1)
			n++;
		}

		return n;
	}
int main(){
	int n,problem=0,i,j,ans[100],a;
	scanf("%d",&n);
	for (i=0;i<n;i++){
		scanf("%d%d%d",&ans[0],&ans[1],&ans[2]);
		if(chk(ans,n)>1){
			problem++;
		}
	}
	printf("%d",problem);

}


#include <stdio.h>
int chk(int ans[100],int k){
	int i,n=0;
	for(i=0;i<k;i++){
		if (ans[i]==1)
			n++;
		}
		return n;
	}
int main(){
	int n,problem=0,i,j,ans[100];

	scanf("%d",&n);
	for(j=0;j<n;j++){

		for(i=0;i<n;i++){
			scanf("%d",&ans[i]);
		}
		if (chk(ans,n)>=2){
			problem++;
		}
	}
	printf("%d",problem);
	return 0;

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    long long n,a[1000][3],dem[1000],z=1,demm=0;
    cin>>n;
    for(int i=1;i<=n;i++)
        {for(int j=1;j<=3;j++)
            {cin>>a[i][j];
            if (a[i][j]==1) dem[z]+=1;}
            z++;}
        for(int i=1;i<=n;i++)
            if (dem[i]>=2) demm++;
    cout<<demm;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{   int n,a[1000][3],dem[1000],z=1,demm;
    cin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=3;j++)
            cin>>a[i][j];
    for(int i=1;i<=n;i++)
        {for(int j=1;j<=3;j++)
            if (a[i][j]==1) dem[z]+=1;
            z++;
        }
        for(int i=1;i<=n;i++)
            if (dem[i]>=2) demm++;
    cout<<demm;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,a[1000][3],dem[1000],z=1,demm=0;
    cin>>n;
    for(int i=1;i<=n;i++)
        {for(int j=1;j<=3;j++)
            {cin>>a[i][j];
            if (a[i][j]==1) dem[z]+=1;}
            z++;}
        for(int i=1;i<=n;i++)
            if (dem[i]>=2) demm++;
    cout<<demm;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,a[1000][100],dem=0,z=1,demm=0;
    cin>>n;
    for(int i=1;i<=n;i++)
        {for(int j=1;j<=3;j++)
            {cin>>a[i][j];
            if (a[i][j]==1) dem+=1;
            }
            if (dem>=2) demm++;
            dem=0;
            }
    cout<<demm;
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{   int n,a[1000][3],dem[1000],z=1,demm=0;
    cin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=3;j++)
            cin>>a[i][j];
    for(int i=1;i<=n;i++)
        {for(int j=1;j<=3;j++)
            if (a[i][j]==1) dem[z]+=1;
            z++;
        }
        for(int i=1;i<=n;i++)
            if (dem[i]>=2) demm++;
    cout<<demm;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    long long n,a[1000][3],dem[1000],z=1,demm=0;
    cin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=3;j++)
            cin>>a[i][j];
    for(int i=1;i<=n;i++)
        {for(int j=1;j<=3;j++)
            if (a[i][j]==1) dem[z]+=1;
            z++;
        }
        for(int i=1;i<=n;i++)
            if (dem[i]>=2) demm++;
    cout<<demm;
}