#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")


enum { NONE, CHAIN, STAR };

int N;
int query(int u, int v) {
  printf("? %d %d\n", u + 1, v + 1);
  fflush(stdout);
  int ret;
  scanf("%d", &ret);
  return ret;
}

int solve() {
  const int half = (N + 1) / 2;
  for (int i = 0; i < half; ++i) {
    const int u = (i * 2 + 0) % N;
    const int v = (i * 2 + 1) % N;
    if (query(u, v)) {
      const int w = (i * 2 + 2) % N;
      const int x = (i * 2 + 3) % N;
      if (query(u, w)) {
        if (query(v, x)) {
          return CHAIN;
        } else {
          return query(u, x) ? STAR : CHAIN;
        }
      } else {
        if (query(v, x)) {
          return query(v, w) ? STAR : CHAIN;
        } else {
          return CHAIN;
        }
      }
    }
  }
  return CHAIN;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &N);
    const int ans = solve();
    printf("! %d\n", ans);
    fflush(stdout);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}