#include<bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define pb push_back
using namespace std;

map<pair<int, int>, int > respuestas;

int rangos = 0, n;

int ask(int l, int r){
  rangos += r - l + 1;
  assert(rangos <= 3* n);
  if(respuestas.count({l, r})){
    return respuestas[{l, r}];
  }
  cout << "? " << l << " " << r << endl;
  cout.flush();
  int answ;
  cin >> answ;
  respuestas[{l, r}] = answ;
  return answ;
}
void responder(int v){
  cout << "! " << v << endl;
  cout.flush();
}

int solv(int l, int r, int p);
int solv(int l, int r){
  if(l == r)return l;
  int p = ask(l, r);
  return solv(l, r, p);
}

int solv(int l, int r, int p){
  if(l == r)return l;
  if(p == l && r - l == 1)return r;
  if(p == r && r - l == 1)return l;
  int mita = (l + r )/2;

  int q1 =l + (((double)r - (double)l)/(double)4);
  int q2 =l + ceil((double)3 * ((double)r - (double)l)/(double)4);
  if(p <= mita){
    int s = ask(l, mita);
    if(s == p){
      return solv(l, mita, p);
    }
    q2 = (mita + 1 + r)/2;
    s = ask(p, q2);
    if(s == p){
      return solv(mita + 1, q2);
    }else{
      return solv(q2 + 1, r);
    }
  }else{

    int s = ask(mita + 1, r);
    if(s == p){
      return solv(mita + 1, r, p);
    }
    q1 = (l + mita + 1) / 2;
    s = ask(q1, p);
    if(s == p){
      return solv(q1, mita);
    }else{
      return solv(l, q1-1);
    }

  }
}





int main(){
  #ifdef LOCAL
  //freopen("in.txt", "r", stdin);
  #endif // LOCAL

  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(NULL);

  int t;
  cin >> t;
  while(t--){
      respuestas.clear();
    cin >> n;
    rangos = 0;
    responder(solv(1, n));

  }


}