#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 1e6 + 5;

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

int T, n;

inline int ask(int l, int r) {
	cout << "? " << l << " " << r << endl;
	int res;
	cin >> res;
	return res;
}

inline void print(int pos) {
	cout << "! " << pos << endl;
}

inline int solve(int l, int r, int pos) {
	if (l == r) {
		return l;
	}
	if (!pos) {
		pos = ask(l, r);
	}
	if (l + 1 == r) {
		return (pos == l) ? r : l;
	}
	int mid = (l + r) >> 1;
	if (pos <= mid) {
		if (ask(l, mid) == pos) {
			return solve(l, mid, pos);
		}
		return solve(mid + 1, r, 0);
	}
	if (ask(mid, r) == pos) {
		return solve(mid, r, pos);
	}
	return solve(l, mid - 1, 0);
}

int main() {
	cin >> T;
	while (T--) {
		cin >> n;
		print(solve(1, n, 0));
	}
	return 0;
}