/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
int chk(int x,int y)
{
	cout<<"? "<<x<<" "<<y<<"\n";
	fflush(stdout);
	int r;
	cin>>r;
	return r;
}
void solve()
{
	int n;
	cin>>n;
	vector <int> vec;
	for(int i=1;i+1<=n;i+=2) if(chk(i,i+1)) vec.pb(i),vec.pb(i+1);
	if(!vec.size()) vec.pb(n);
	if(vec.size()>2)
	{
		cout<<"! 1\n";
		fflush(stdout);
		return;
	} 
	if(vec.size()==1)
	{
		if(chk(n,1)&&chk(n,2)&&chk(n,3)) cout<<"! 2\n";
		else cout<<"! 1\n";
		fflush(stdout);
		return;
	}
	int u=vec[0],v=vec[1];
	vector <int> v2;
	for(int i=1;i<=n;i++) if(i!=u&&i!=v) v2.pb(i);
	if(chk(v2[0],u))
	{
		if(chk(v2[1],u)) cout<<"! 2\n";
		else cout<<"! 1\n";
		fflush(stdout);
		return;
	} 
	else
	{
		if(chk(v2[0],v)&&chk(v2[1],v)) cout<<"! 2\n";
		else cout<<"! 1\n";
		fflush(stdout);
		return;
	}
}
signed main()
{
//	ios::sync_with_stdio(0);
//	cin.tie(0);
	int _=1;
	cin>>_;
	while(_--) solve();
	return 0;
}