#include <bits/stdc++.h>
#define maxn 1000007
#define int long long
#define dl long double
#define mod 1000000007
using namespace std;
inline int pls(int a, int b) {int m = a + b; return m < mod ? m : m - mod;}
inline int dec(int a, int b) {int m = a - b; return m < 0 ? m + mod : m;}
inline int mul(int a, int b) {return 1ll * a * b % mod;}
inline int fpow(int a, int b) {
  int ans = 1;
  for(; b; b >>= 1,a = mul(a, a)) if(b & 1) ans = mul(ans, a);
  return ans;
}
inline int inv(int a) {return fpow(a, mod - 2);}
inline int dvi(int a, int b) {return mul(a, inv(b));};
inline int qread() {
  char c = getchar(); int num = 0, f = 1;
  for(; !isdigit(c); c=getchar()) if(c == '-') f = -1;
  for(; isdigit(c); c=getchar()) num = num * 10 + c - '0';
  return num * f;
}
int t;
int n;
void query(int x, int y) {
  printf("? %lld %lld\n", x, y);
  fflush(stdout);
}
void solve() {
  n = qread();
  int x, y, num = 0;
  int cur;
  for(int i = 2; i <= n; i += 2) {
    query(i, i - 1);
    cur = qread();
    num += cur;
    if(cur) {
      x = i - 1, y = i;
    }
  }
  if(n % 2) {
    query(n, n - 1);
    cur = qread();
    num += cur;
    if(cur) {
      if(num == 2 && y == n - 1) {
        query(1, y);
        cur = qread();
        if(cur) {
          printf("! 2\n");
          fflush(stdout);
        } else {
          printf("! 1\n");
          fflush(stdout);
        }
        return;
      }
      x = n - 1, y = n;
    }
  }
  
  if(num != 1) {
    printf("! 1\n");
    fflush(stdout);
  } else {
    int xx = y % n + 1;
    int yy = xx % n + 1;
    
    query(x, xx);
    cur = qread();
    if(cur) {
      query(x, yy);
      cur = qread();
      if(cur) {
        printf("! 2\n");
        fflush(stdout);
      } else {
        printf("! 1\n");
        fflush(stdout);
      }
    } else {
      query(y, xx);
      cur = qread();
      if(cur) {
        query(y, yy);
        cur = qread();
        if(cur) {
          printf("! 2\n");
          fflush(stdout);
        } else {
          printf("! 1\n");
          fflush(stdout);
        }
      } else {
        printf("! 1\n");
        fflush(stdout);
      }
    }
  }
}
signed main() {
  t = qread();
  while(t--) {
    solve();
  }
  return 0;
}