/*
code.cpp
Standard IO
*/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
#define db double

using namespace std;
const db eps=1e-6;
const int inf=0x3f3f3f3f;
const ll lnf=(ll)1e18+10;
ll read() {
	ll o=0,w=1;char c=getchar();
	while(c<'0'||c>'9') {if(c=='-') w=-1;c=getchar();}
	while(c>='0'&&c<='9') {o=o*10+c-'0';c=getchar();}
	return o*w;
}

namespace dada {

int n;
int dis(int x,int y) {
	return min((x-y+n)%n,(y-x+n)%n);
}
int ask(int x,int y) {
	printf("? %d %d\n",x,y);
	fflush(stdout);
	return read();
}
int pre(int x,int k) {
	return (x-1-k+n)%n+1;
}
int suf(int x,int k) {
	return (x-1+k)%n+1;
}
int Main() {
	n=read();
	int sx=0,sy=0,d=0;
	bool fd=0;
	for(int i:{1,n,2}) {
		for(int j=n/2;j<=(n+1)/2;j++) {
			sx=i,sy=suf(i,j);
			d=ask(sx,sy);
			if(d!=dis(sx,sy)) {
				fd=1;
				break;
			}
		}
		if(fd) break;
	}
	if(sx>sy) swap(sx,sy);
	if(d==1) {
		printf("! %d %d\n",sx,sy);
		return read()!=1;
	}
	// cerr<<d<<'\n';
	d=dis(sx,sy)-d;
	// cerr<<sx<<' '<<sy<<' '<<d<<'\n';
	int d1=ask(pre(sx,1),sy);
	int d2=ask(suf(sx,1),sy);
	int rt=0;
	if(d1==d2) rt=sx;
	else if(d1<d2) {
		// cerr<<"toL\n";
		int l=1,r=(sx-sy+n)%n,res=0;
		while(l<=r) {
			int mid=(l+r)/2,x=pre(sx,mid);
			if(dis(x,sy)==ask(x,sy)+d) res=mid,l=mid+1;
			else r=mid-1;
		}
		rt=pre(sx,res);
	} else {
		// cerr<<"toR\n";
		int l=1,r=(sy-sx+n)%n,res=0;
		while(l<=r) {
			int mid=(l+r)/2,x=suf(sx,mid);
			if(dis(x,sy)==ask(x,sy)+d) res=mid,l=mid+1;
			else r=mid-1;
		}
		rt=suf(sx,res);
	}
	// cerr<<rt<<'\n';
	printf("! %d %d\n",rt,(ask(rt,pre(rt,d+1))==1?pre(rt,d+1):suf(rt,d+1)));
	return read()!=1;
}






}

int main() {
	int T=read();
	while(T--) {
		if(dada::Main()) return 0;
	}
	return 0;
}

/*
cd QOJ9734
g++ code.cpp -o code -std=c++14 -Wall -O2 -static -lm 
time ./code
cp 1.in .in
diff .out 1.ans -w | head -n 10
*/