#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 ask(int l, int r){
  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 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();
    int n;
    cin >> n;
    int p = ask(1, n);

    bool atras = false;
    if(p == 1)atras = false;
    else if(p == n)atras = true;
    else if(p <= n/2 && ask(1, p) == p || p > n/2 && ask(p, n) != p)atras = true;
    int answ = 0;
    if(atras){

      int li = 1, ls = p - 1, mid;
      while(li + 1 < ls){
        mid = (li + ls)/2;
        if(ask(mid, p) == p)li = mid;
        else ls = mid - 1;
      }
      for(int i = ls ; i >= li ; i --){
        if(ask(i, p)){
          answ = i;
          break;
        }
      }
    }else{
      int li = p + 1, ls = n, mid;
      while(li + 1 < ls){
        mid = (li + ls)/2;
        if(ask(p, mid) == p)ls = mid;
        else li = mid + 1;
      }
      for(int i = li ; i <= ls ; i ++){
        if(ask(p, i)){
          answ = i;
          break;
        }
      }
    }
    responder(answ);

  }


}