#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int base,tot;
const int maxn = 1e6 + 10;
const double EPS = 1e-6;
int dp[maxn],g[maxn];
map<pair<int,int>,int> mp;
int ask(int l,int r)
{
    if(mp[{l,r}])
    {
        return mp[{l,r}];
    }
    // tot++;
    // assert(tot<=base);
    cout<<"? "<<l<<" "<<r<<endl;
    int pos;
    cin>>pos;
    return mp[{l,r}]=pos;
}
int query(int l,int r)
{
    if(l==r)
    {
        return l;
    }
    else if(r-l+1==2)
    {
        int p=ask(l,r);
        if(p==l)
        {
            return r;
        }
        else
        {
            return l;
        }
    }
    else
    {
        int p=ask(l,r);
        int mid=(l+g[r-l+1]);
        if(p>=mid&&p<=r)//[l,mid-1] [mid,r]
        {
            if(ask(mid,r)==p)
            {
                return query(mid,r);
            }
            else
            {
                return query(l,mid-1);
            }
        }
        else//[l,mid] [mid+1,r]
        {
            mid=(r-g[r-l+1]);
            if(ask(l,mid)==p)
            {
                return query(l,mid);
            }
            else
            {
                return query(mid+1,r);
            }
        }
    }
}
void solve(void)
{
    mp.clear();
   //base=tot=0;
    int n;
    cin>>n;
    //base=ceill(1.5*log2l(n))+1;
    int ans=query(1,n);
    cout<<"! "<<ans<<endl;
}
int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    dp[1]=0;
    dp[2]=1;
    int now=1;
    for(int i=3;i<=1e6;i++)
    {
        while(now+1<=i-(now+1)&&max(dp[now]+2,dp[i-now]+1)>=max(dp[now+1]+2,dp[i-(now+1)]+1))
        {
            now++;
        }
        g[i]=now;
        dp[i]=max(dp[now]+2,dp[i-now]+1);
    }
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}