#include<iostream>
#include<random>
#include<map>
using namespace std;
mt19937 Rand(20080704);
#define rand Rand
int T,n,cntq;
map<pair<int,int>,int> f;
inline int query(int x,int y)
{
	if(x>y)
	{
		swap(x,y);
	}
	if(abs(x-y)<=1)
	{
		return abs(x-y);
	}
	if(f.count({x,y}))
	{
		return f[{x,y}];
	}
	if((++cntq)>40)
	{
		while(1);
	}
	cout<<"? "<<x+1<<" "<<y+1<<endl;
	int z;
	cin>>z;
	f[{x,y}]=z;
	return z;
}
inline void print(int x,int y)
{
	cout<<"! "<<x+1<<" "<<y+1<<endl;
	cin>>x;
	if(x<0)
	{
		exit(0);
	}
}
inline int dis(int x,int y)
{
	return min(abs(x-y),n-abs(x-y));
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>T;
	while(T--)
	{
		cntq=0,f.clear();
		cin>>n;
		int tmp,x,y,X,Y;
		while(1)
		{
			x=rand()%n;
			y=(x+(n>>1)+((n&1)?(rand()&1):0))%n;
			if((tmp=query(x,y))<dis(x,y))
			{
				break;
			}
		}
		if(tmp==1)
		{
			print(x,y);
			continue;
		}
		X=x,Y=y;
		if(query((x+n-1)%n,y)<tmp)
		{
			int l=2,r=(x+n-y)%n,ans=1;
			while(l<=r)
			{
				int mid=l+r>>1;
				(query((x+n-mid)%n,y)==tmp-mid)
				?(l=(ans=mid)+1):(r=mid-1);
			}
			X=(x+n-ans)%n;
		}
		else if(query((x+1)%n,y)<tmp)
		{
			int l=2,r=(y+n-x)%n,ans=1;
			while(l<=r)
			{
				int mid=l+r>>1;
				(query((x+mid)%n,y)==tmp-mid)
				?(l=(ans=mid)+1):(r=mid-1);
			}
			X=(x+ans)%n;
		}
		if(query(x,(y+n-1)%n)<tmp)
		{
			Y=(y+n-(query(X,y)-1))%n;
		}
		else if(query(x,(y+1)%n)<tmp)
		{
			Y=(y+(query(X,y)-1))%n;
		}
		print(X,Y);
	}
	return 0;
}