#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
#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(1) 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;

// check 1-2, 3-4, 5-6, ..., n-1, n
void rsolve() {
  int n;
  cin >> n;
  vector<array<int, 2>> v;
  if(n%2 == 0) {
    for(int i = 1; i <= n; i += 2) v.pb({i, i+1});
  }
  else {
    for(int i = 1; i < n; i += 2) v.pb({i, i+1});
    v.pb({n, 1});
  }
  map<int, int> deg;
  set<array<int, 2>> valid;
  map<int, set<int>> seen;
  auto qry = [&](int x, int y) -> int {
    if(seen[x].count(y)) return valid.count({x, y});
    assert(!seen[x].count(y));
    assert(!seen[y].count(x));
    seen[x].insert(y);
    seen[y].insert(x);
    cout << "? " << x << " " << y << endl;
    int ret;
    cin >> ret;
    deg[x] += ret;
    deg[y] += ret;
    if(ret) {
      valid.insert({x, y});
      valid.insert({y, x});
    }
    return ret;
  };
  array<int, 2> init = {-1, -1};
  for(auto [x, y]: v) {
    int ret = qry(x, y);
    if(ret == 1) {
      init = {x, y};
      break;
    }
  }
  if(init[0] == -1) {
    cout << "! 1" << endl;
    return;
  }
  int x = 1 + rand()%n;
  while(x == init[0] || x == init[1]) {
    x = 1 + rand()%n;
  }
  assert(x != init[0] && x != init[1]);
  if(qry(init[0], x)) {
    // init[0] is deg 2
    assert(deg[init[0]] == 2);
    int cand = 1;
    while(seen[init[0]].count(cand) || cand == init[0]) cand++;
    if(qry(init[0], cand)) {
      cout << "! 2" << endl;
      return;
    }
    else {
      cout << "! 1" << endl;
      return;
    }
    assert(false);
  }
  else {
    if(qry(init[1], x)) {
      int cand = 1;
      while(seen[init[1]].count(cand) || cand == init[1]) cand++;
      if(qry(init[1], cand)) {
        cout << "! 2" << endl;
        return;
      }
      else {
        cout << "! 1" << endl;
        return;
      }
    }
    else {
      cout << "! 1" << endl;
      return;
    }
    assert(false);
  }
  assert(false);
}
void solve() {
  int t;
  cin >> t;
  while(t--) rsolve();  
}

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