// #define LOCAL
#include <bits/stdc++.h>
#define fir first
#define sec second
#define el '\n'
using namespace std;
using PII = pair<int, int>;
const int N = 1000010;
mt19937_64 rng{chrono::steady_clock::now().time_since_epoch().count()};
int n, p[N], cnt = 0, ress = 0;
int fib[N], f[N], las[N], fir[N];
void input()
{
	cin >> n;
	// n = rand() % 16 + 1;
	// cout << ceil(1.5 * log(n) / log(2)) << endl;
#ifdef LOCAL
	vector<int> vis(n + 1, 0);
	for (int i = 1; i <= n; i++) {
		int res = rng() % n + 1;
		while (vis[res])
			res = rng() % n + 1;
		vis[res] = 1;
		p[i] = res;
	}
	/*cout << n << endl;
	for (int i = 1; i <= n; i++) {
		cout << p[i] << " ";
	}
	cout << endl;*/
#endif
}
int query(int l, int r)
{
	cnt++;
	ress += (r - l + 1);
	assert(cnt <= ceil(1.5 * log(n) / log(2)));
	assert(ress <= n * 3);
#ifdef LOCAL
	map<int, int> mp;
	for (int i = l; i <= r; i++) {
		mp.insert(PII(p[i], i));
	}
	auto res = mp.end();
	res--;
	res--;
	return res->sec;
#else
	int inp;
	cout << "? " << l << " " << r << endl;
	cin >> inp;
	return inp;
#endif
}
int getans(int l, int r, int flag)
// flag == 0 表示 需要询问l-r的答案，否则答案为flag
{
	if (l == r) {
		return l;
	}
	if (!flag) {
		flag = query(l, r);
	}
	// cout << l << " " << r << " " << flag << endl;
	if (r == l + 1) {
		return l + r - flag;
	}

	int len = r - l + 1;
	// cout << len << " " << las[len] << endl;
	if (l + las[len] - 1 >= flag) {
		// flag在左半区间
		int now = query(l, l + las[len] - 1);
		if (now == flag) {
			return getans(l, l + las[len] - 1, now);
		}
		else {
			return getans(l + las[len], r, 0);
		}
	}
	else if (r - las[len] + 1 <= flag) {
		int now = query(r - las[len] + 1, r);
		if (now == flag) {
			return getans(r - las[len] + 1, r, now);
		}
		else {
			return getans(l, r - las[len], 0);
		}
	}
}
void solve()
{
	cnt = 0, ress = 0;
	input();
	int ans = getans(1, n, 0);
#ifdef LOCAL
	// cout << "right ans :: ";
	for (int i = 1; i <= n; i++) {
		if (p[i] == n) {
			cout << "right ans :: " << i << endl;
		}
	}

#endif
	cout << "! " << ans << endl;
}
int main()
{
	int maxn = 1000000, tot = 0;
	f[1] = 0, f[2] = 1;
	fib[1] = 1, fib[2] = 2;
	las[2] = 1;
	for (tot = 3;; tot++) {
		fib[tot] = fib[tot - 1] + fib[tot - 2];
		if (fib[tot] > maxn)
			break;
	}
	for (int i = 3; i <= maxn; i++) {
		las[i] = 0;
		int fl = 0;
		for (int j = tot; j >= 1; j--) {
			if (fib[j] < i) {
				fir[i] = i - fib[j - 1];
				las[i] = fib[j];
				break;
			}
		}
		f[i] = 1 + max(f[las[i]], 1 + f[i - las[i]]);
		// cout << i << " " << las[i] << endl;
		if (abs(fir[i] - (i + 1) / 2) <= abs((i + 1) / 2 - las[i])) {
			las[i] = fir[i];
		}
	}
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}