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

void solve(int l,int r,int L,int R,bool typ){
	if(l==r && L==R){
		if(typ) swap(l,L);
		cout<<"! "<<l-1<<" "<<L-1<<'\n';
		int s; cin>>s;
		return ;
	}
	if(R-L<r-l){
		solve(L,R,l,r,typ^1);
		return ;
	}
	int MID=(L+R)>>1;
	int tot=0,lst=0;
	if(l-1>=1){
		if(!typ) cout<<"? "<<l-1<<" "<<MID<<'\n';
		else cout<<"? "<<MID<<" "<<l-1<<'\n';
		cin>>lst;
	}
	for(int i=l;i<r;i++){
		if(!typ) cout<<"? "<<i<<" "<<MID<<'\n';
		else cout<<"? "<<MID<<" "<<i<<'\n';
		int s; cin>>s;
		if(s || lst) tot++;
		lst=s;
	}
	if(lst) tot++;
	
	if(((r-l+1)*(MID-L+1)%2)^(tot%2)) solve(l,r,L,MID,typ);
	else solve(l,r,MID+1,R,typ);
}

int main(){
	cin>>T;
	while(T--){
		cin>>n;
		if(n & 1){
			cout<<"! -1 -1"<<'\n';
			int s; cin>>s;
			continue;
		}
		solve(1,n+1,1,n+1,0);
	}
	
}