#include<bits/stdc++.h>
using namespace std;
int T,n,k,d,X,x,y,l,r,mid;
int ask(int x,int y){return cout<<"? "<<(x-1)%n+1<<" "<<(y-1)%n+1<<endl,cin>>X,X;}
void get(int x,int y){cout<<"! "<<(x-1)%n+1<<" "<<(y-1)%n+1<<endl,cin>>X;}
void solve(){
	cin>>n,k=n/2,x=1,y=k+1;
	while(ask(x,y)==k)if(n%2==0)x++,y++;else (x+k<y?x:y)++;
	d=X;
	if(ask(x,y+1)==d-1)x+=n,swap(x,y);
	l=x,r=y;
	while(l<=r){
		mid=l+r>>1;
		if(ask(x,mid)==d-y+mid)l=mid+1;
		else r=mid-1;
	}
	d=ask(x,l);
	if(ask(n+x-d+1,l)==1)get(n+x-d+1,l);
	else get(x+d-1,l);
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>T;
	while(T--)solve();
	return 0;
}