#include <bits/stdc++.h>
using namespace std; 
typedef long long i64; 

int n;  
int ask(int u, int v) {
    cout << "? " << u << " " << v << endl; 
    return cin >> u, u; 
}

void solve(void) {
    cin >> n; 
    int u = -1, v = -1; 
    for (int i = 1; i <= n; i += 2)
        if (ask(i, i + 1)) { u = i, v = i + 1; break; }
    if (u == -1 && ask(n - 1, n)) u = n - 1, v = n; 
    if (u == -1) return cout << "! 1" << endl, void(); // 一定不是菊花
    int t1 = -1, t2 = -1; 
    for (int i = 1; i <= n; ++i) if (i != u && i != v) { t1 = i; break; }
    for (int i = 1; i <= n; ++i) if (i != u && i != v && i != t1) { t2 = i; break; }
    int x = ask(u, t1), y = ask(v, t1); 
    // cout << u << " " << v << "\n"; 
    // cout << x << " " << y << "\n"; 
    if (!x && !y) return cout << "! 1" << endl, void(); 
    if (x && ask(u, t2)) return cout << "! 2" << endl, void(); 
    if (y && ask(v, t2)) return cout << "! 2" << endl, void(); 
    cout << "! 1" << endl; 
}

int main(void) {
    ios::sync_with_stdio(0); 
    int T; cin >> T; 
    while (T--) solve(); 
    return 0; 
}