#include <bits/stdc++.h>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)
#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end()

using ll = long long;
using ull = unsigned long long;
using ld = long double;

template<class T>
bool chmin(T &a, T b) {
    if(a <= b) return false;
    a = b;
    return true;
}

template<class T>
bool chmax(T &a, T b) {
    if(a >= b) return false;
    a = b;
    return true;
}

void solve() {
    int n;
    std::cin >> n;
    auto query = [&](int u, int v) -> int {
        std::cout << "? " << u << " " << v << std::endl;
        int a;
        std::cin >> a;
        return a;
    };
    auto is_star = [&](int u, int v) -> bool {
        int x = 1;
        while(x == u || x == v) x++;
        int a = query(x, u);
        int b = query(x, v);
        int y = -1;
        if(a == 1) y = u;
        else if(b == 1) y = v;
        else assert(0);
        int z = 1;
        while(z == x || z == u || z == v) z++;
        int c = query(y, z);
        return c == 1;
    };
    auto answer = [&](int u, int v) -> void {
        if(is_star(u, v)) {
            std::cout << "! 2" << std::endl;
        }
        else {
            std::cout << "! 1" << std::endl;
        }
    };
    rep(i,0,n/2) {
        int u = 2 * i + 1;
        int v = 2 * i + 2;
        int res = query(u, v);
        if(res == 1) {
            answer(u, v);
            return;
        }
    }
    if(n % 2 == 1) {
        int u = n-1;
        int v = n;
        int res = query(u, v);
        if(res == 1) {
            answer(u, v);
            return;
        }
    }
    std::cout << "! 1" << std::endl;
}

int main() {
    int t;
    std::cin >> t;
    while(t--) {
        solve();
    }
}