#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int Mod = 998244353;
inline void uadd(int &a, const int &b){ a += b - Mod; a += (a>>31) & Mod; }
inline int add(int a, const int &b){ a += b - Mod; a += (a>>31) & Mod; return a; }
inline void usub(int &a, const int &b){ a -= b; a += (a>>31) & Mod; }
inline int sub(int a, const int &b){ a -= b, a += (a>>31) & Mod; return a; }
inline void umul(int &a, const int &b){ a = (int)(1ll * a * b % Mod); }
inline int mul(const int &a, const int &b){ return (int)(1ll * a * b % Mod); }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p & 1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 10010;
int fact[fN], invfact[fN], inv[fN];
void initfact(int n){
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i - 1], i);
	invfact[n] = qpow(fact[n], Mod - 2); for(int i = n; i > 0; --i) invfact[i - 1] = mul(invfact[i], i);
	for(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i - 1]);
}
inline int binom(int n, int m){ return mul(fact[n], mul(invfact[m], invfact[n - m])); }

const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
template<typename T> inline void chmax(T &_a, const T &_b){ (_b>_a) ? (_a=_b) : _a; }
template<typename T> inline void chmin(T &_a, const T &_b){ (_b<_a) ? (_a=_b) : _a; }

int n;
int cc, cl;
int qry(int l, int r){
	cc += 1, cl += (r - l + 1);
	cout << "? " << l << " " << r << endl;
	int x;
	cin >> x;
	return x;
}
int calc(int l, int r, int p){
	if(p < 0){
		if(l == r) return l;
		else p = qry(l, r);
	}
	if(r == l + 1) return l + r - p;
	int len = max(2, (int)((63ll * (r - l + 1)) / 100));
	int l1, r1, l2, r2;
	if(p <= l + len - 1){
		l1 = l, r1 = l + len - 1;
		l2 = l + len, r2 = r;
	} else {
		l1 = r - len + 1, r1 = r;
		l2 = l, r2 = r - len;
	}
	int ret = qry(l1, r1);
	if(ret == p)
		return calc(l1, r1, p);
	else 
		return calc(l2, r2, -1);
}
void solve(){
	cin >> n;
	cc = cl = 0;
	int ret = calc(1, n, -1);
	cout << "! " << ret << endl;
	//cerr << cc << " " << cl << endl;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	int T;
	cin >> T;
	while(T--) solve();

	return 0;
}