#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

inline int rd() {
	int x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

inline int query(int l, int r) {
	printf("? %d %d\n", l, r);
	fflush(stdout); return rd();
}

int divide(int l, int r, int pos) {
	if (l == r) return l;
	if (!pos) pos = query(l, r);
	if (l == r - 1) return l + r - pos;
	int len = max(2.0, ceil((r - l + 1) / 1.7));
	int lmid = r - len + 1, rmid = l + len - 1;
	if (pos <= (l + r) / 2) {
		int npos = query(l, rmid);
		if (npos == pos) return divide(l, rmid, pos);
		return divide(rmid + 1, r, 0);
	} else {
		int npos = query(lmid, r);
		if (npos == pos) return divide(lmid, r, pos);
		return divide(l, lmid - 1, 0);
	}
}

int main() {
	per(t, rd(), 1) {
		printf("! %d\n", divide(1, rd(), 0)); 
		fflush(stdout);
	}
	return 0;
}