#include <bits/stdc++.h>

std::mt19937_64 rng {std::chrono::steady_clock::now().time_since_epoch().count()};

int n;
int ask(int x, int y) {
	std::cout << "? " << x << " " << y << std::endl;
	int res;
	std::cin >> res;
	return res;
}

int ok(int x, int y) {
	int p1 = -1, p2 = -1;
	for (int i = 1; i <= n; i ++) {
		if (i != x && i != y) {
			if (p1 == -1) {
				p1 = i;
			} else {
				p2 = i;
				break;
			}
 		}
	}

	if (ask(x, p1) && ask(x, p2) || ask(y, p1) && ask(y, p2)) {
		std::cout << "! 2" << std::endl;
		return 0;
	}
	std::cout << "! 1" << std::endl;
	return 1;
}
void solve() {
	std::cin >> n;
	int cnt = (n + 1) / 2 + 3;
	int l = 1, r = 2;
	while (cnt --) {
		if (l > n || r > n) {
			break;
		}
		if (ask(l, r)) {
			ok(l, r);
		} else {
			l += 2, r += 2;
		}
	}
	if (n % 2 == 0) {
		std::cout << "! 1" << std::endl;
	} else {
		if (ask(n, 1)) {
			ok(n, 1);
		} else if (ask(n, 2)) {
			ok(n, 2);
		} else {
			std::cout << "! 1" << std::endl;
		}
	}
	return;
}
int main() {
	int t;
	std::cin >> t;

	while (t --) {
		solve();
	}
	return 0;
}