#include<bits/stdc++.h>
#define pii pair<int,int>
using namespace std;
map<pii,int> mp;
const int N=1e6+5;
void answer(int x)
{
	printf("! %d\n",x);
	fflush(stdout);
	return;
}
int query(int l,int r)
{
	if(mp.find({l,r})!=mp.end()) return mp[{l,r}];
	int x;
	printf("? %d %d\n",l,r);
	fflush(stdout);
	scanf("%d",&x);
	mp[{l,r}]=x;
	return x;
}
void solve(int l,int r)
{
	if(l==r)
	{
		answer(l);
		return;
	}
	int mid=(l+r)/2,lmid,x=query(l,r),y;
	if(l+1==r)
	{
		if(x==l) answer(r);
		else answer(l);
		return;
	}
	int len=max(2,(int)((r-l+1)*0.6));
	if(x<=mid)
	{
		y=query(l,l+len-1);
		if(x==y) solve(l,l+len-1);
		else solve(l+len,r);
	}
	else
	{
		y=query(r-len+1,r);
		if(x==y) solve(r-len+1,r);
		else solve(l,r-len);
	}
	return;
}
int T,n;
int main()
{
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		solve(1,n);
		mp.clear();
	}
	return 0;
}