#include<bits/stdc++.h>
using namespace std;
const int N=1100;
int T,n;
int f[N][N],g[N][N];

int cal(int x,int y){
	if(x>n || y>n) return 0;
	if(f[x][y]!=-1) return f[x][y];
	cout<<"? "<<x<<" "<<y<<'\n';
	cin>>f[x][y];
	return f[x][y];
}

vector < pair<int,int> > P,Q;

int calc(int l,int r,int L,int R){
	int tot=(r-l+1)*(R-L+1)%2,lst;
	P.clear(),Q.clear();
	
	l--,L--;
	for(int j=L;j<=R;j++){
		P.push_back(make_pair(l,j));
		if(r!=l) P.push_back(make_pair(r,j));
	}
	for(int i=l+1;i<=r-1;i++){
		P.push_back(make_pair(i,L));
		if(R!=L) P.push_back(make_pair(i,R));
	}
	l++,L++;
	
	for(pair<int,int> p: P){
		int x=p.first,y=p.second;
		if(cal(x,y)) g[x][y]=g[x+1][y]=g[x][y+1]=g[x+1][y+1]=1;
	}
	
	
	Q.clear();
	for(int j=L;j<=R;j++){
		Q.push_back(make_pair(l,j));
		if(r!=l) Q.push_back(make_pair(r,j));
	}
	for(int i=l+1;i<=r-1;i++){
		Q.push_back(make_pair(i,L));
		if(R!=L) Q.push_back(make_pair(i,R));
	}
	
	for(pair<int,int> p: Q){
		int x=p.first,y=p.second;
		tot^=g[x][y];
//		cout<<" "<<x<<" "<<y<<": "<<s<<'\n';
	}
	
	for(pair<int,int> p: P){
		int x=p.first,y=p.second;
		g[x][y]=g[x+1][y]=g[x][y+1]=g[x+1][y+1]=0;
	}
	
	return tot;
}

void solve(int l,int r,int L,int R){
	if(l==r && L==R){
		cout<<"! "<<l-1<<" "<<L-1<<'\n';
		int s; cin>>s;
		return ;
	}
	if(R-L>r-l){
		int MID=(L+R)>>1;
		if(calc(l,r,L,MID)) solve(l,r,L,MID);
		else solve(l,r,MID+1,R);
	}
	else{
		int mid=(l+r)>>1;
		if(calc(l,mid,L,R)) solve(l,mid,L,R);
		else solve(mid+1,r,L,R);
	}
}

int main(){
	cin>>T;
	while(T--){
		cin>>n;
		for(int i=1;i<=n+1;i++)
			for(int j=1;j<=n+1;j++)
				f[i][j]=-1;
		if(n & 1){
			cout<<"! -1 -1"<<'\n';
			int s; cin>>s;
			continue;
		}
		solve(1,n+1,1,n+1);
	}
	
}