#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define range(x) (x).begin(),(x).end()
const int dir[][2]={1,0,-1,0,0,1,0,-1};

int ask(int u,int v)
{
    cout<<"? "<<u<<' '<<v<<endl;
    int ans;
    cin>>ans;
    return ans;
}
void solve()
{
    int n;
    cin>>n;

    for(int i=1;i<=n;i+=2){
        int now;
        int v;
        if(i==n)
            now = ask(i,i-1),v=i-1;
        else 
            now = ask(i,i+1),v=i+1;

        if(now){
            int p=1;
            while(p==i||p==v)
                ++p;

            int root=i;
            now=ask(i,p);
            if(!now){
                now=ask(v,p);
                if(!now){
                    cout<<"! 1"<<endl;
                    return;
                }
                root=v;
            }

            int q=1;
            while(q==i||q==p||q==v)
                ++q;
            now=ask(root,q);
            if(now)
                cout<<"! 2"<<endl;
            else
                cout<<"! 1"<<endl;

            return;
        }
    }
}

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