#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N;
int mod(int u) {
  return ((u %= N) < 0) ? (u + N) : u;
}

#ifdef LOCAL
vector<vector<int>> D;
void build(int a, int b) {
  D.assign(N, vector<int>(N, N));
  for (int u = 0; u < N; ++u) D[u][u] = 0;
  for (int u = 0; u < N; ++u) {
    const int v = (u + 1) % N;
    chmin(D[u][v], 1);
    chmin(D[v][u], 1);
  }
  chmin(D[a][b], 1);
  chmin(D[b][a], 1);
  for (int w = 0; w < N; ++w) for (int u = 0; u < N; ++u) for (int v = 0; v < N; ++v) {
    chmin(D[u][v], D[u][w] + D[w][v]);
  }
}
int dist(int u, int v) {
  return D[mod(u)][mod(v)];
}

void exper() {
  for (N = 8; N <= 20; ++N) {
    int mx = 0;
    for (int a = 0; a < N; ++a) for (int b = a + 1; b < N; ++b) {
      if ((a + 1) % N == b) continue;
      if ((b + 1) % N == a) continue;
      build(a, b);
      vector<pair<pair<int, int>, int>> es;
      int u = 0, v = N/2;
      for (int i = 0; i < N; ++i) {
        const int d = dist(u, v);
        es.emplace_back(make_pair(u, v), d);
        if (d < N/2) goto found;
        if (N & 1) {
          (i & 1) ? ++u : ++v;
        } else {
          ++u;
          ++v;
        }
      }
      cerr << "FAIL " << N << " " << a << " " << b << ": " << es << endl;
      assert(false);
     found:{}
      // cerr << N << " " << a << " " << b << ": " << es << endl;
      chmax(mx, (int)es.size());
    }
    cerr << "DONE N = " << N << ": mx = " << mx << endl;
  }
}
#endif

int ask(int u, int v) {
  u = mod(u);
  v = mod(v);
  assert(0 <= u); assert(u < N);
  assert(0 <= v); assert(v < N);
#ifdef LOCAL
  return D[u][v];
#else
  printf("? %d %d\n", u + 1, v + 1);
  fflush(stdout);
  int ret;
  scanf("%d", &ret);
  return ret;
#endif
}

// u->v uses the chord && u: endpoint
pair<int, int> finish(int u, int v) {
  const int d = ask(u, v);
  for (const int d0 : {mod(v - u), N - mod(v - u)}) {
    const int c = d0 - (d - 1);
// cerr<<"[finish] u = "<<u<<", v = "<<v<<", c = "<<c<<endl;
    for (const int w : {u + c, u - c}) {
      if (ask(u, w) == 1) return make_pair(mod(u), mod(w));
    }
  }
  assert(false);
}
pair<int, int> solve() {
  int u = 0, v = N/2, d;
  for (int i = 0; ; ++i) {
    d = ask(u, v);
    if (d < N/2) break;
    if (N & 1) {
      (i & 1) ? ++u : ++v;
    } else {
      ++u;
      ++v;
    }
  }
  u = mod(u);
  v = mod(v);
// cerr<<"u = "<<u<<", v = "<<v<<", d = "<<d<<endl;
  int dir;
  if (ask(u + 1, v) == d - 1) {
    dir = +1;
  } else if (ask(u - 1, v) == d - 1) {
    dir = -1;
  } else {
    return finish(u, v);
  }
  int lo = 0, hi = mod((v - u) / dir);
  for (; lo + 1 < hi; ) {
    const int mid = (lo + hi) / 2;
    ((ask(u + mid * dir, v) == d - mid) ? lo : hi) = mid;
  }
  return finish(u + lo * dir, v);
}

#ifdef LOCAL
void stress() {
  for (N = 4; N <= 40; ++N) {
    for (int a = 0; a < N; ++a) for (int b = a + 1; b < N; ++b) {
      if ((a + 1) % N == b) continue;
      if ((b + 1) % N == a) continue;
      build(a, b);
      cerr << COLOR("93") << N << " " << a << " " << b << COLOR() << endl;
      const auto res = solve();
      cerr << "  res = " << res << endl;
      assert(res == make_pair(a, b) || res == make_pair(b, a));
    }
  }
}
#endif

int main() {
  // exper(); return 0;
  // stress(); return 0;
  
  int T;
  scanf("%d", &T);
  for (int t = 0; t < T; ++t) {
    scanf("%d", &N);
    const auto res = solve();
    printf("! %d %d\n", res.first + 1, res.second + 1);
    fflush(stdout);
    int ret;
    scanf("%d", &ret);
    if (ret == -1) exit(0);
  }
  return 0;
}