#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
*/

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

        if (r == 0) {
            printf("! 2\n"); // chain
            fflush(stdout);
            continue;
        }

        int p1 = -1, p2 = -1;
        // choose 2 arbitrary nodes other than u and v
        for (int i = 1; i <= n; i++) {
            if (i != u && i != v) {
                if (p1 == -1) {
                    p1 = i;
                } else {
                    p2 = i;
                    break;
                }
            }
        }

        int r1, r2;
        printf("? %d %d\n", p1, u);
        fflush(stdout);
        scanf("%d", &r1);
        printf("? %d %d\n", p1, v);
        fflush(stdout);
        scanf("%d", &r2);

        if (!r1 && !r2) {
            printf("! 2\n"); // chain
            fflush(stdout);
        } else {
            if (r2) {
                swap(u, v);
            }
            printf("? %d %d\n", p2, u);
            fflush(stdout);
            scanf("%d", &r1);
            if (r1) {
                printf("! 1\n"); // star
                fflush(stdout);
            } else {
                printf("! 2\n"); // chain
                fflush(stdout);
            }
        }
    }
}