#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cstring>
#include <iomanip>
#include <unordered_map>
#include <numeric>

#define sc_int(x) scanf("%d", &x)

#define x first
#define y second
#define pb push_back

using namespace std;

const int N = 510, M = 2e5 + 10, MOD = 1e9 + 7;
const int inf = 1e9;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef pair<char, int> PCI;
typedef pair<string, string> PSS;

int n, m;

int query(int i, int j)
{
    int res;
    cout << "? " << i << " " << j << endl;
    cin >> res;
    return res;
}

void solve() 
{
    cin >> n;
    bool flag = 0;
    map<PII, int> mp;
    for(int i = 1; i + 1 <= n; i += 2)
    {
        mp[{i, i + 1}] = query(i, i + 1);
    }
    if(n & 1) mp[{1, n}] = query(1, n);
    int i = -1, j = -1;
    for(auto [x, y] : mp)
    {
        if(y) 
        {
            i = x.x, j = x.y;
            break;
        }
    }
    if(i == -1 && j == -1)
    {
        cout << "! " << 1 << endl;
        return;
    }
    for(int t = 1; t <= n; t ++)
    {
        if(t != i && t != j)
        {
            if(query(t, i) || query(t, j))
            {
                cout << "! " << 2 << endl;
            }
            else 
            {
                cout << "! " << 1 << endl;
            }
            break;
        }
    }
}

int main()
{
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    // ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    
    int T = 1;
    cin >> T;
    while(T --)
    {
        solve();
    }
}