#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int,int>
#define lowbit(x) (x&-x)
using namespace std;
int n;
bool qry(int x,int y){
	printf("? %d %d",x,y);cout<<endl;
	int p;
	scanf("%d",&p);
	return p;
}
void solve(int x,int y){
	for(int i=1;i<=n;i++){
		if(i!=x&&i!=y){
			if(qry(i,x)){
				for(int j=1;j<=n;j++){
					if(j==i||j==x||j==y)continue;
					if(qry(j,x)){
						printf("! 2");
						cout<<endl;
						return;
					}
					else{
						printf("! 1");
						cout<<endl;
						return;
					}
				}
				
			}
			else{
				break;
			}
		}
	}
	swap(x,y);
	for(int i=1;i<=n;i++){
		if(i!=x&&i!=y){
			if(qry(i,x)){
				for(int j=1;j<=n;j++){
					if(j==i||j==x||j==y)continue;
					if(qry(j,x)){
						printf("! 2");
						cout<<endl;
						return;
					}
					else{
						printf("! 1");
						cout<<endl;
						return;
					}
				}
				
			}
			else{
				break;
			}
		}
	}
	printf("! 1");
	cout<<endl;
}
void solve(){
	scanf("%d",&n);
	for(int i=1;i<=n;i+=2){
		int tmp=i;
		if(i==n)tmp--;
		if(qry(tmp,tmp+1)){
			solve(tmp,tmp+1);
			return;
		}
	}
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--)solve();
	return 0;
}