#include<iostream>
#include<cstdio>
#include<cmath>
#define lowbit(x) x&(-x)
#include<queue>
#include<vector>
#include<algorithm>
#define ll long long
using namespace std;
int tt,n,pos,cnt1,cnt2,f[2000005],g[2000005];
double k=0.618;
void solve(int l,int r,int ls){
	if(l==r){
		printf("! %d\n",l);
		fflush(stdout);
		return;
	}
	if(r-l==1){
		if(ls){
			printf("! %d\n",(ls==l)?r:l);
			fflush(stdout);
			return;
		}
		printf("? %d %d\n",l,r);
		fflush(stdout);
		scanf("%d",&pos);
		printf("! %d\n",(pos==l)?r:l);
		fflush(stdout);
		cnt1++,cnt2+=r-l+1;
		return;
	}
	if(!ls){
		printf("? %d %d\n",l,r);
		fflush(stdout);
		scanf("%d",&pos);
		cnt1++,cnt2+=r-l+1;
		ls=pos;
	}
	int m2=l+g[r-l+1]-1,m1=r-g[r-l+1]+1;
	if(ls<=m1){
		printf("? %d %d\n",l,m1);
		fflush(stdout);
		scanf("%d",&pos);
		cnt1++,cnt2+=m1-l+1;
		if(m1-l==1){
			printf("! %d\n",(pos==m1)?l:m1);
			fflush(stdout);
			return;
		}
		if(pos==ls){
			solve(l,m1,ls);
		}
		else solve(m1+1,r,0);
	}
	else{
		printf("? %d %d\n",m2,r);
		fflush(stdout);
		scanf("%d",&pos);
		cnt1++,cnt2+=r-m2+1;
		if(r-m2==1){
			printf("! %d\n",(pos==m2)?r:m2);
			fflush(stdout);
			return;
		}
		if(pos==ls){
			solve(m2,r,ls);
		}
		else solve(l,m2-1,0);
	}
}
int F(int x,int i){
	return max(f[x]+1,f[i-x]+2);
}
int main(){
	scanf("%d",&tt);
	f[1]=0,f[2]=1;
	for(int i=3;i<=1e6;++i){
		int l=1,r=i-1;
		while(l+4<r){
			int m1=(r-l)/3+l,m2=(r-l)/3+m1;
			if(F(m1,i)<F(m2,i)) r=m2;
			else l=m1;
		}
		f[i]=1e9;
		for(int j=max(l-5,1);j<=min(l+5,i-1);++j){
			if(F(j,i)<=f[i]) f[i]=F(j,i),g[i]=j;
		}
	}
	while(tt--){
		cnt1=cnt2=0;
		scanf("%d",&n);
		solve(1,n,0);
	}
}