#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;

int ok(int i, int j, int n) {
	while (i > n)
		i -= n;
	while (j > n)
		j -= n;
	cout << "? " << i << " " << j << endl;
	int t; cin >> t;
	return t;
}

void solve() {
	int n; cin >> n;
	for (int i = 1; i <= n; i += 2) {
		if (!ok(i, i + 1, n))
			continue;
		int deg = ok(i, i + 2, n);
		if (deg == 1)
			deg += ok(i, i + 3, n);
		if (deg == 2 || deg == 0 && ok(i + 1, i + 2, n) && ok(i + 1, i + 3, n)) {
			cout << "! 2" << endl;
			return;
		}
		break;
	}
	cout << "! 1" << endl;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
		int t; cin >> t; while (t--) solve();
}