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

#define ll long long
#define ld long double
#define endl "\n"

const int N = 2e5 + 5;

int query(int u,int v){
	cout<<"? "<<u<<" "<<v<<endl;
	cout.flush();
	int ans;
	cin>>ans;
	return ans;
}

void solve(){
	int n;
	cin>>n;
	int u=-1,v;
	for(int i=1;i+1<=n;i+=2){
		int ans = query(i, i+1);
		if(ans == 1){
			u = i;
			v = i + 1;
			break;
		}
	}
	if(u == -1){
		cout<<"! 1\n";
		return;
	}
	int w;
	for(int i=1;i<=n;i++){
		w = i;
		if(w != u && w != v)break;
	}
	int ww;
	for(int i=1;i<=n;i++){
		ww = i;
		if(ww != u && ww != v && ww != w)break;
	}
	int ans = query(u, w);
	if(ans == 1){
		ans = query(u, ww);
		if(ans == 1){//xing 
			cout<<"! 2\n";
		}
		else cout<<"! 1\n";
	}
	else {
		ans = query(v, w);
		if(ans == 1){
			ans = query(v, ww);
			if(ans == 1){
				cout<<"! 2\n";
			}
			else cout<<"! 1\n";
		}
		else cout<<"! 1\n";
	}
}

signed main(){
//	ios::sync_with_stdio(false);
//	cin.tie(nullptr);
//	cout.tie(nullptr);
	int t = 1;
	cin>>t;
	for(int i=1;i<=t;i++)solve();
	return 0;
}