#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N=1e6+3;
ll n;
int Ask(int l,int r)
{
	cout<<"? "<<l<<" "<<r<<endl;
	int x;cin>>x;
	return x;
	//return query(l,r);
}
int Sol(int l,int r)
{
	if(l==r)return l;
	int p=Ask(l,r),op=0;
	if(l+1==r)return p==l?l+1:l;
	if(p-l<=r-p)op=(p==l||Ask(l,p)!=p)?1:0;
	else op=(p==r||Ask(p,r)!=p)?0:1;
	if(!op)
	{
		int kl=l,kr=p-1;
		while(kl<kr)
		{
			int mi=(kl+kr)/2+1;
			if(Ask(mi,p)==p)kl=mi;
			else return Sol(l,mi-1);
		}
		return p-1;
	}
	else
	{
		int kl=p+1,kr=r;
		while(kl<kr)
		{
			int mi=(kl+kr)/2;
			if(Ask(p,mi)==p)kr=mi;
			else return Sol(mi+1,r); 
		}
		return p+1;
	}
}
void Solve()
{
	cin>>n;
	int x=Sol(1,n);
	cout<<"! "<<x<<endl; 
}
int main()
{
	int T;cin>>T;
	while(T--)Solve();
	return 0;
}