#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>   
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;   
using namespace std;
#define ll long long
#define nline "\n"
#define f first
#define s second
#define sz(x) x.size()
#define vl vector<ll>
const ll INF_MUL=1e13;
const ll INF_ADD=1e18;
#define all(x) x.begin(),x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
//--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------     
const ll MOD=998244353;
const ll MAX=500500;
map<pair<ll,ll>,ll> cache;
ll query(ll l,ll r){
  if(cache.find({l,r})!=cache.end()){
    return cache[{l,r}];
  }
  cout<<"? "<<l<<" "<<r<<endl;
  ll x; cin>>x;
  cache[{l,r}]=x;
  return x;
}
ll getv(ll l,ll r){
  ll x=rng()%(r-l+1);
  return l+x;
}
ll solve(ll l,ll r,ll pos=-1){
  if(l==r){
    return l;
  }
  if(l+1==r){
    return l+r-query(l,r);
  }
  if(pos==-1){
    pos=query(l,r);
  }
  ll now=(l+r)/2;
  if(pos<=now){
    if(query(l,now)==pos){
      return solve(l,now,pos);
    }
    else{
      return solve(now+1,r,-1);
    }
  }
  else{
    if(query(now,r)==pos){
      return solve(now,r,pos);
    }
    else{
      return solve(l,now-1,-1);
    }
  }
}
void solve(){
  ll n; cin>>n;
  cache.clear();
  ll ans=solve(1,n,-1);
  cout<<"! "<<ans<<endl;
  return;
}
int main()                                                                                 
{         
  ios_base::sync_with_stdio(false);                         
  cin.tie(NULL);                                  
  ll test_cases=1;                 
  cin>>test_cases;
  while(test_cases--){
    solve();
  }
  cout<<fixed<<setprecision(10);
  cerr<<"Time:"<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n"; 
}