#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e6 + 5;
int query(int l, int r) {
	cout << "? " << l << " " << r << endl;
	int x; cin >> x;
	return x;
}
int getlen(int l, int r) {
	return (r - l) * 2 / 3;
}
void solve() {
	int n; cin >> n;
	int l = 1, r = n, lst = query(1, n);
	while(l + 1 < r) {
		lst = query(l, r);
		if(lst <= (l + r) / 2) {
			int mid = l + getlen(l, r);
			if(lst == query(l, mid))
				r = mid;
			else
				l = mid;
		}
		else {
			int mid = r - getlen(l, r);
			if(lst == query(mid, r))
				l = mid;
			else
				r = mid;
		}
	}
	cout << "!" << (l == r ? l : (l == lst ? r : l)) << endl;
}
signed main() {
	int T; cin >> T;
	while(T--)
		solve();
	return 0;
}