// Problem: J. Mysterious Tree
// Contest: Codeforces - The 2023 ICPC Asia Hangzhou Regional Contest (The 2nd Universal Cup. Stage 22: Hangzhou)
// URL: https://codeforces.com/gym/104976/problem/J
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
using namespace std;
using db = double;
using lb = long double;
using ull = unsigned long long;
using uint = unsigned int;
using ll = long long;
//using i128 = __int128;
//using ui128 = unsigned __int128;
#define REP(i, first, last) for(int i = (first); i <= (last); ++ i)
#define DOW(i, first, last) for(int i = (first); i >= (last); -- i)
#define int long long
#define pb emplace_back
#define ob pop_back
#define pii pair<int, int>
#define MPR make_pair
#define fi first
#define se second
#define tpl tuple<int, int, int>
#define MTP make_tuple
#define poly vector<int>
#define polyp vector<pii>
#define polyt vector<tpl>
#define all(x) x.begin(), x.end()
#define CVR(a, q) memset(a, q, sizeof a)
#define CLR(a) memset(a, 0, sizeof a)
#define CPY(a, q) memcpy(a, q, sizeof a)
#define PCT __builtin_popcount
const int N = 1e6 + 5, M = 1e6 + 5;
const int mod1 = 1e9 + 7, mod2 = 998244353, mod = 1e9 + 7;
const long long inf = 1e18;
const int dx[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
void Solve() {
	int n; cin >> n;
	int now = -1;
	REP(i, 1, n) 
		if((i & 1) && i + 1 <= n) {
			cout << "? " << i << ' ' << i + 1 << endl;
			int x; cin >> x;
			if(x == 1) {
				now = i;
				break;
			}
		}
	if(now < 0 && (n & 1)) {
		cout << "? " << n - 1 << ' ' << n << endl;
		int x; cin >> x;
		if(x == 1) now = n - 1; 
	}
	if(now < 0) {
		cout << "! 1" << endl;
		return ;
	}
	int u = now, v = now + 1;
	poly p;
	REP(i, 1, n) if(i != u && i != v) p.pb(i);
	int x = p[0], y = p[1];
	cout << "? " << u << ' ' << x << endl;
	int opt, ans = 0; cin >> opt;
	ans += opt;
	cout << "? " << v << ' ' << x << endl;
	cin >> opt, ans += opt * 2;
	if(!ans) {
		cout << "! 1" << endl;
		return ;
	}
	if(ans == 2) {
		cout << "? " << v << ' ' << y << endl;
		cin >> opt;
		if(opt == 1) cout << "! 2" << endl;
		else cout << "! 1" << endl;
		return ;
	}
	else {
		cout << "? " << u << ' ' << y << endl;
		cin >> opt;
		if(opt == 1) cout << "! 2" << endl;
		else cout << "! 1" << endl;
		return ;
	}
}
signed main() {
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	int T = 1;
	cin >> T;
	while (T --) {
		Solve();
	}
	return 0;
}