#include <bits/stdc++.h>

using namespace std;

/*
interactive problem
judge if the tree is a star or a chain
a star has 1 node with degree n-1 and the rest with degree 1
a chain has 2 nodes with degree 1 and the rest with degree 2
max number of queries allowed is n/2+4

1=chain, 2=star
*/

int n;

int query(int x, int y) {
    printf("? %d %d\n", x, y);
    fflush(stdout);
    int r;
    scanf("%d", &r);
    return r;
}

void answer(int x) {
    printf("! %d\n", x);
    fflush(stdout);
}

int solve(int x, int y) {
    int z = -1, w = -1;
    for (int i = 1; i <= n; i++) {
        if (i != x && i != y) {
            if (z == -1) {
                z = i;
            } else {
                w = i;
                break;
            }
        }
    }
    int r = query(x, z);
    if (r) {
        r = query(x, w);
        if (r) {
            return 2; // star
        } else {
            return 1; // chain
        }
    } else {
        r = query(y, z);
    }
    
    if (r) {
        r = query(y, w);
        if (r) {
            return 2; // star
        } else {
            return 1; // chain
        }
    } else {
        return 1; // chain
    }
    return 1;
}

int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        scanf("%d", &n);
        int u = -1, v = -1;
        for (int i = 1; i < n; i+=2) {
            int r = query(i, i+1);
            if (r) {
                u = i;
                v = i+1;
                break;
            }
        }
        if (n & 2 && u == -1) {
            int r = query(n-1, n);
            if (r) {
                u = n-1;
                v = n;
            }
        }

        if (u == -1) {
            answer(1); // chain
        } else {
            answer(solve(u, v));
        }
    }
}