#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<ll, int, int> tii;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

inline void work() {
    int n = rd();
    auto query = [&](int u, int v) {
        printf("? %d %d\n", u, v); fflush(stdout); return rd();
    };
    int u = 0, v = 0;
    for (int i = 1; i < n; i += 2) 
        if (query(i, i + 1)) {u = i; v = i + 1; break;}

    if (!u && (n & 1)) if (query(n, n - 1)) {u = n; v = n - 1;}
    if (!u) {puts("! 1"); fflush(stdout); return;}
    int a = 1, b = 1;
    while (a == u || a == v) ++a;
    while (b == u || b == v || b == a) ++b;
    if (query(u, a)) puts(query(u, b) ? "! 2" : "! 1");
    else puts((query(v, a) && query(v, b)) ? "! 2" : "! 1");
    fflush(stdout);
}

int main() {
    per(t, rd(), 1) work();
    return 0;  
}