#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
#define vc vector
using namespace std;
template<class T> using vv = vc<vc<T>>;
template<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; using LP = pair<ll,ll>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<class T>string join(const T&v,const string&d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<class T>void vin(vc<T>&a){int n;cin>>n;a=vc<T>(n);cin>>a;}
template<class T>void vin(vv<T>&a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}
template<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}
template<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<class T1,class T2>void operator+=(vc<T1>&a,T2 b){for(T1&x:a)x+=b;}
template<class T1,class T2>void operator-=(vc<T1>&a,T2 b){for(T1&x:a)x-=b;}
template<class T1,class T2>void operator*=(vc<T1>&a,T2 b){for(T1&x:a)x*=b;}
template<class T1,class T2>void operator/=(vc<T1>&a,T2 b){for(T1&x:a)x/=b;}
template<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<class T1,class T2>pair<T1,T2>operator+(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi+b.fi,a.se+b.se};}
template<class T1,class T2>pair<T1,T2>operator-(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi-b.fi,a.se-b.se};}
template<class T>pair<T,T>operator*(const pair<T,T>&a,T b){return {a.fi*b,a.se*b};}
template<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<class T>T min(const vc<T>&a){return *min_element(rng(a));}
template<class T>T max(const vc<T>&a){return *max_element(rng(a));}
template<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<class T>ll suma(const vc<T>&a){ll s=0;for(auto&&x:a)s+=x;return s;}
template<class T>ll suma(const vv<T>&a){ll s=0;for(auto&&x:a)s+=suma(x);return s;}
template<class T>void uni(T&a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<class T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define rtn(x) { cout<<(x)<<'\n'; return;} // flush!
#define yn {puts("Yes");}else{puts("No");}
template<class F> ll bis(ll ac, ll wa, F f) {
  while (abs(ac-wa)>1) { ll wj=(ac+wa)/2; (f(wj)?ac:wa)=wj;} return ac;
}
template<class F> ll bis2(F f) { // 0:true -> max true
  ll r = 1; while (f(r)) r <<= 1; return bis(r>>1,r,f);
}
random_device _rd;
struct xrand {
  static const uint64_t _x = 88172645463325252ull;
  uint64_t x;
  xrand(): x(_x ^ (_rd()+time(0))) {}
  xrand(uint64_t seed): x(_x ^ seed) {}
  uint64_t get() {
    x = x ^ (x << 7);
    return x = x ^ (x >> 9);
  }
  ull operator()() { return get();}
  ull operator()(ull n) { return get()%n;}
  ll operator()(ll l, ll r) { return get()%(r-l+1) + l;}
} rnd;
template<typename T> void shuffle(vc<T>& a) {
  for (int i = a.size(); i >= 2; --i) swap(a[i-1],a[rnd(i)]);
}

// #define TEST

struct Solver {
  void solve() {
    int N;

    #ifdef TEST
    int nl = 1<<rnd(2,29), nr = nl<<1;
    mins(nl,int(1e9)); mins(nr,int(1e9));
    N = rnd(nl,nr);
    int wl = 1<<rnd(1,29), wr = wl<<1;
    mins(wl,N-2); mins(wr,N-2);
    int A = rnd(1,N), w = rnd(wl,wr);
    int B = (A-1+w)%N+1;
    cerr<<"N: "<<" "<<N<<endl;
    cerr<<"answer: "<<" "<<A<<" "<<B<<endl;
    #else
    cin>>N;
    #endif

    auto dist = [&](int a, int b) { return min(abs(a-b),N-abs(a-b));};

    int CNT = 40;
    auto fix = [&](int a) {
      return (a%N+N)%N + 1;
    };
    map<P,int> memo;
    auto f = [&](int a, int b) {
      a = fix(a); b = fix(b);
      if (a > b) swap(a,b);
      if (memo.count(P(a,b))) return memo[P(a,b)];
      CNT--; assert(CNT >= 0);
      cout<<"? "<<a<<" "<<b<<endl;
      int d;
      #ifdef TEST
      d = dist(a,b);
      mins(d, dist(A,a)+1+dist(B,b));
      mins(d, dist(A,b)+1+dist(B,a));
      cerr<<"-> "<<d<<endl;
      #else
      cin>>d;
      #endif
      return memo[P(a,b)] = d;
    };
    auto answer = [&](int a, int b) {
      a = fix(a); b = fix(b);
      if (a > b) swap(a,b);
      cout<<"! "<<a<<" "<<b<<endl;
      #ifdef TEST
      assert(P(a,b) == P(A,B) || P(b,a) == P(A,B));
      #else
      int correct;
      cin>>correct;
      #endif
    };

    int n = N/2;

    auto same = [&](int a, int b) {
      // cerr<<"same "<<a<<' '<<b<<endl;
      int d = f(a,b);
      auto g = [&](int w) {
        return (f(a+w,b) == d-w);
      };
      int nw = bis(0,n,g);
      a += nw; d = f(a,b);
      b -= (d-1);
      answer(a,b);
    };
    auto opo = [&](int a, int b) {
      // cerr<<"opo "<<a<<' '<<b<<endl;
      int d = f(a,b);
      int sg = (d<=f(a+1,b+1))?-1:1;
      auto g = [&](int w) {
        int nd = f(a+w*sg,b+w*sg);
        return nd == d-2*w;
      };
      int nw = bis(0,n,g);
      a += nw*sg; b += nw*sg; d = f(a,b);
      // a or b is correct
      d--;
      if (dist(a,b+d) != 1 && f(a,b+d) == 1) answer(a,b+d);
      else if (dist(a,b-d) != 1 && f(a,b-d) == 1) answer(a,b-d);
      else if (dist(a+d,b) != 1 && f(a+d,b) == 1) answer(a+d,b);
      else answer(a-d,b);
    };

    if (N%2 == 0) {
      int a = 0, b = n, d = f(a,b);
      while (d == n) a++, b++, d = f(a,b);
      if (d == f(a+1,b+1)) { // same side
        if (f(a+1,b) >= d) swap(a,b);
        same(a,b);
      } else { // opo
        opo(a,b);
      }
    } else {
      int a = 0, b = n, d1 = f(a,b), d2 = f(a,b+1);
      while (d1 == n && d2 == n) {
        b++; swap(a,b); d2 = f(a,b+1);
      }
      if (d1 == n || d2 == n) {
        if (d1 == n) {
          if (f(a+1,b+1) == n) same(b,a);
          else opo(a,b);
        } else {
          b++;
          if (f(a-1,b-1) == n) same(a,b);
          else opo(a,b);
        }
      } else {
        if (f(a+1,b+1) == d1) {
          if (f(a+1,b) >= d1) swap(a,b);
          same(a,b);
        } else {
          opo(a,b);
        }
      }
    }
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  cin>>ts;
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}