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

// Function to compute ceil(n / 2)
int ceil_div2(int n) {
    return (n + 1) / 2;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        // Compute the number of queries allowed
        int max_queries = ceil_div2(n) + 3;
        // Initialize count of connections for vertex 1
        int count = 0;
        // To keep track of queries done
        int queries_done = 0;
        // To store vertices already queried to avoid duplicates
        // Not strictly necessary since we're querying vertex 1 with distinct vertices
        for(int i=2; i<=n && queries_done < max_queries; ++i){
            // Query "? 1 i"
            cout << "? " << 1 << " " << i << "\n";
            cout.flush();
            // Read the response
            string response;
            cin >> response;
            if(response == "1"){
                count++;
                // If count exceeds 2, it's a star
                if(count > 2){
                    break;
                }
            }
            queries_done++;
        }
        // Decide based on the count
        if(count > 2){
            // It's a star
            cout << "! 2\n";
            cout.flush();
        }
        else{
            // It's a chain
            cout << "! 1\n";
            cout.flush();
        }
        // It's important to read any remaining responses to keep the interactor in sync
        // However, since the interactor is adaptive, no further actions are needed
    }
    return 0;
}