#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define inf 0x3f3f3f3f
#define db double
#define il inline
#define x first
#define y second
const int N = 2e5 + 5;
const int mod = 998244353;
int ask(int u,int v)
{
    cout<<"? "<<u<<" "<<v<<endl;
    int s;cin>>s;
    return s;
}
void solve()
{
    int n;cin>>n;
    int s=0;
    for(int i=1;i<=n;i+=2)
    {
        if(ask(i,i+1)) 
        {
            s=i;
            break;
        }
    }
    if(s==0 && (n&1)) 
    {
        if(ask(1,n)) s=n;
    }
    if(s==0) 
    {
        cout<<"! 1\n";
    }
    else 
    {
        int s2;
        if(s!=n) s2=s+1;
        else s2=1;

        int a1=0,a2=0;
        for(int i=1;i<=n;i++)
        {
            if(i==s||i==s2) continue;
            if(a1==0) a1=i;
            else 
            {
                a2=i;
                break;
            }
        }
        int b1=ask(s,a1),b2=ask(s2,a1);
        if(b1==0&&b2==0)
        {
            cout<<"! 1\n";
        }
        else 
        {
            int f;
            if(b1) f=ask(s,a2);
            else f=ask(s2,a2);
            if(f) cout<<"! 2\n";
            else cout<<"! 1\n";
        }
    }
}
signed main()
{
    int T = 1; cin >> T;
    while (T--) solve();
    return 0;
}