#include <bits/stdc++.h>
using i64 = long long;

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

void solve() {
	int n;
	std::cin >> n;
	std::vector<std::pair<int, int>> res;
	for(int i = 0; i < n; i += 2) {
		int x = i + 1, y = (i + 1) % n + 1;
		if(res.size() > 2) break;
		if(ask(x, y)) {
			res.push_back({x, y});
		}
	}
	if(n % 2 == 0) {
		if(res.size() != 1) {
			std::cout << "! 1" << std::endl;
		} else {
			auto [x, y] = res.front();
			int res1 = ask(x, y % n + 1);
			int res2 = ask(y, y % n + 1);
			if(res1 == 1 && ask(x, (y + 1) % n + 1)) {
				std::cout << "! 2" << std::endl;
			} else if(res2 == 1 && ask(y, (y + 1) % n + 1)) {
				std::cout << "! 2" << std::endl;
			} else {
				std::cout << "! 1" << std::endl;
			}
		}
	} else if(n % 2 == 1) {
		if(res.size() == 1) {
			auto [x, y] = res.front();
			int res1 = ask(x, y % n + 1);
			int res2 = ask(y, y % n + 1);
			if(res1 == 1 && ask(x, (y + 1) % n + 1)) {
				std::cout << "! 2" << std::endl;
			} else if(res2 == 1 && ask(y, (y + 1) % n + 1)) {
				std::cout << "! 2" << std::endl;
			} else {
				std::cout << "! 1" << std::endl;
			}
		} else if(res.size() == 2) {
			auto [x, y] = res.front();
			if(ask(x, (y + 1) % n + 1)) {
				std::cout << "! 2" << std::endl;
			} else {
				std::cout << "! 1" << std::endl;
			}
		} else {
			std::cout << "! 1" << std::endl;
		}
	}
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int T;
	std::cin >> T;
	while(T--) {
		solve();
	}
	return 0;
}