#include<bits/stdc++.h>
using namespace std;
double A = (sqrt(5)-1)/2.0;
int solve1(int l,int r);
int solve2(int l,int r);
int solve0(int l,int r);
int sum ,n ,cnt , K;int T;
int ask(int x,int y){
	cnt ++ ;
	sum += y-x+1;
	assert(cnt <= K);
	int ans;
	cout << "? " << x << " " << y << endl;cout.flush();
	cin >> ans;
	return ans;
}
// 
int solve0(int l,int r){
	if(l==r){
		return l;
	}
	int x = ask(l,r);
	if(x==l) return solve1(l,r);
	if(x==r) return solve2(l,r);
	int len1 = x - l + 1;
	int len2 = r - x + 1;
	if(len1<=len2 || rand()%3==0){
		int y = ask(l,x);
		if(y==x) return solve2(l,x);
		else return solve1(x,r);
	}else {
		int y = ask(x,r);
		if(y==x) return solve1(x,r);
		return solve2(l,x);
	}
}
// 左端
int solve1(int l,int r){
	if(l==r) return l;
	if(r-l==1) return l + 1;
	int len = max(A * (double)(r-l+1),2.0);
	int x = ask(l,l+len-1);
	if(x == l) return solve1(l,l+len-1);
	else return solve0(l+len,r);
}
int solve2(int l,int r){
	if(l==r) return l;
	if(r-l==1) return l;
	int len = max(A * (double)(r-l+1),2.0);
	int x = ask(r-len+1,r);
	if(x == r) return solve2(r-len+1,r);
	else return solve0(l,r-len);
}

signed main()
{
	srand(time(0));
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> T;
	while(T-->0){
		cin >> n;
		sum = 0;
		cnt = 0 ;
		K = ceil(1.5 *log2(n));
		int ans =  solve0(1,n) ;
		cout << "!" << " " << ans << endl;
		cout.flush();
	}
    return 0;
}