#include <bits/stdc++.h>
using namespace std;
#define ls now<<1
#define rs now<<1|1
#define lowbit(x) ((x)&(-x))
typedef long long ll;
const int N=1e5+7, mod=1e9+7;

int n;

void solve(){
    cin>>n;
    int len=1;
    int l=-1,r=-1;
    for(int i=1;i<=n;i+=2){
        printf("? %d %d\n",i,i+1);
        int x;
        cin>>x;
        if(x){
            l=i,r=i+1;
            break;
        }
    }
    if(n&1){
        printf("? %d %d\n",n,n-1);
        int x;
        cin>>x;
        if(x){
            l=n-1,r=n;
        }
    }
    if(l==-1&&r==-1){
        printf("! 1");
        cout<<endl;
    }
    else{
        int t1,t2,t3,x1,x2;
        if(l==1)t1=n;
        else t1=l-1;
        if(r==n)t2=1;
        else t2=r+1;
        printf("? %d %d\n",l,t1);
        cin>>x1;
        printf("? %d %d\n",r,t2);
        cin>>x2;
        if(x1){
            printf("? %d %d\n",l,t1-1);
            cin>>x1;
            if(x1){
                printf("! 2");
                cout<<endl;
            }
            else {
                printf("! 1");
                cout<<endl;
            }
        }
        if(x2){
            printf("? %d %d\n",r,t2+1);
            cin>>x2;
            if(x2){
                printf("! 2");
                cout<<endl;
            }
            else {
                printf("! 1");
                cout<<endl;
            }
        }
    }
}

int main(){
    int t=1;
    cin>>t;
    while(t--)solve();
    return 0;
}