//#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define N 300005
#define mod 998244353
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define ls (rt<<1)
#define rs ((rt<<1)|1)
#define fi first
#define se second
#define INF 1e9
#define rep(i,l,r) for(int i=(l);i<=(r);i++)
int qpow(int a,int b){
	int res=1;
	for(;b;b>>=1){
		if(b&1) res=res*a%mod;
		a=a*a%mod;
	}
	return res;
}
/*int fac[N],ifac[N];
int C(int n,int m){
	if(m>n||m<0||n<0) return 0;
	return fac[n]*ifac[n-m]%mod*ifac[m]%mod;
}
void init(){
	fac[0]=1;
	for(int i=1;i<N;i++) fac[i]=fac[i-1]*i%mod;
	ifac[N-1]=qpow(fac[N-1],mod-2);
	for(int i=N-2;i>=0;i--) ifac[i]=ifac[i+1]*(i+1)%mod;
}*/
inline int lowbit(int x){return x&(-x);}
inline int read(){
  int x=0,t=1;char ch=getchar();
  while(ch<'0'||ch>'9'){
    if(ch=='-') t=-1;
    ch=getchar();
  }
    while(ch>='0'&&ch<='9'){
        x=(x<<1)+(x<<3)+(ch-'0');
        ch=getchar();
    }
    return x*t;
}
inline void write(int x){
	if(x<0) putchar('-'),x=-x;
	if(x>=10) write(x/10);
	putchar(x%10+'0');
}
int T,n,a[N],s[N],q[N],head,tail,t[N],cnt;
signed main(){
	cin>>T;
	while(T--){
		cin>>n;int lim=n/2,c=0,pos=0;
		for(int i=1;i<=lim;i++){
			cout<<"? "<<2*i-1<<" "<<2*i<<endl;
			cin>>c;
			if(c==1){
				pos=i;
				break;
			}
		}
		if(pos==0){
			if(n%2==0) cout<<"! 1"<<endl;
			else{
				int fl=1;
				for(int i=1;i<=3;i++){
					cout<<"? "<<i<<" "<<n<<endl;
					cin>>c;fl&=c;
				}
				if(fl) cout<<"! 2"<<endl;
				else cout<<"! 1"<<endl;
			}
		}else{
			cnt=0;
			for(int i=1;i<=n;i++)
				if((i+1)/2!=pos) t[++cnt]=i;
			cout<<"? "<<t[1]<<" "<<2*pos-1<<endl;
			cin>>c;
			if(c==0){
				int fl=1,d=0;
				cout<<"? "<<t[1]<<" "<<2*pos<<endl;
				cin>>d;fl&=d;
				cout<<"? "<<t[2]<<" "<<2*pos<<endl;
				cin>>d;fl&=d;
				if(fl) cout<<"! 2"<<endl;
				else cout<<"! 1"<<endl;
			}else{
				cout<<"? "<<t[2]<<" "<<2*pos-1<<endl;
				cin>>c;
				if(c) cout<<"! 2"<<endl;
				else cout<<"! 1"<<endl;
			}
		}
	}
	return 0;
}