#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(0) cerr
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << flush;
// END NO SAD

template<class Fun>
class y_combinator_result {
  Fun fun_;
public:
  template<class T>
  explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

  template<class ...Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

template<class T>
bool updmin(T& a, T b) {
  if(b < a) {
    a = b;
    return true;
  }
  return false;
}
template<class T>
bool updmax(T& a, T b) {
  if(b > a) {
    a = b;
    return true;
  }
  return false;
}
typedef int64_t ll;

int full[1000001]; // assumes no info
int expensive[1000001]; // assumes has info
void init() {
  full[2] = 1;
  expensive[2] = 1;
  for(int i = 3; i <= 1000000; i++) {
    // 1 to figure out the side, ceil(log to figure out the rest)
    expensive[i] = 1 + ceil(log2(i-1));
  }
}
void rsolve() {
  int n;
  cin >> n;
  int qcnt = ceil(log2(n) * 1.5);
  map<array<int, 2>, int> dp;
  auto qry = [&](int lhs, int rhs) -> int { 
    assert(lhs < rhs);
    array<int, 2> key = {lhs, rhs};
    if(dp.count(key)) return dp[key];
    cout << "? " << lhs << " " << rhs << endl;
    int ret;
    cin >> ret;
    dp[key] = ret;
    qcnt--;
    return ret;
  };
  auto dfs = y_combinator([&](auto self, int lhs, int rhs, int secondlargest) -> int {
    if(lhs == rhs) return lhs;
    assert(rhs > lhs);
    if(rhs-lhs == 1) {
      if(secondlargest >= 0) return rhs + lhs - secondlargest;
      return rhs + lhs - qry(lhs, rhs);
    }
    if(secondlargest == -1) secondlargest = qry(lhs, rhs);
    assert(lhs <= secondlargest && secondlargest <= rhs);
    int nxtsz = (rhs-lhs+1) - (rhs-lhs+1)/2;
    if(rhs-lhs + 1 < n && max(expensive[nxtsz] + 1, expensive[(rhs-lhs+1)-nxtsz] + 2) > qcnt) {
      // go hard
      bool leftside = false;
      bool confirm = false; // true only if must be
      if(lhs == secondlargest) {
        confirm = true;
      }
      else if(rhs == secondlargest) {
        leftside = true;
        confirm = true;
      }
      else if(lhs+1 == secondlargest);
      else if(rhs-1 == secondlargest) {
        leftside = true;
      }
      else {
        confirm = true;
        if(secondlargest - lhs < rhs - secondlargest) {
          if(qry(lhs, secondlargest) == secondlargest) leftside = true;
        }
        else {
          if(qry(secondlargest, rhs) != secondlargest) leftside = true;
        }
      }
      if(leftside) {
        // check [lhs, secondlargest]
        int ans = -1;
        if(confirm) {
          ans = lhs++;
        }
        rhs = secondlargest-1;
        while(lhs <= rhs) {
          int mid = (lhs+rhs)/2;
          if(qry(mid, secondlargest) == secondlargest) {
            ans = mid;
            lhs = mid+1;
          }
          else rhs = mid-1;
        }
        if(ans == -1) return secondlargest+1;
        return ans;
      }
      else {
        // check [secondlargest, rhs]
        int ans = -1;
        if(confirm) {
          ans = rhs--;
        }
        lhs = secondlargest+1;
        while(lhs <= rhs) {
          int mid = (lhs+rhs)/2;
          if(qry(secondlargest, mid) == secondlargest) {
            ans = mid;
            rhs = mid-1;
          }
          else lhs = mid+1;
        }
        if(ans == -1) return secondlargest-1;
        return ans;
      }
    }
    else {
      int mid = (lhs+rhs)/2;
      if(secondlargest <= mid) {
        if(lhs < mid && qry(lhs, mid) == secondlargest) return self(lhs, mid, secondlargest);
        else return self(mid+1, rhs, -1);
      }
      else {
        mid = (lhs+rhs-1)/2;
        assert(mid < secondlargest && secondlargest <= rhs);
        if(mid+1 < rhs && qry(mid+1, rhs) == secondlargest) return self(mid+1, rhs, secondlargest);
        else return self(lhs, mid, -1);
      }
    }
  });
  int ret = dfs(1, n, -1);
  cout << "! " << ret << endl;
}
void solve() {
  init();
  int t;
  cin >> t;
  while(t--) rsolve();
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points
// are you not using modint when you should

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}