#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 1e5 + 3;
const double D = 1 / 2.5874;
int T;
int n, num, ret;

int query(int l, int r){
	cout << "? " << l << " " << r << endl;
	cin >> ret;
	return ret;
}
void ans(int x){	cout << "! " << x << endl;}
int solve(int l, int r) {
	// <= 2
	if(l == r) {
		return l;
	}
	int x = query(l, r);
	if(r - l + 1 <= 2) {
		return (l == x) ? r : l;
	}
	while(1) {
		if(r - l + 1 <= 2) {
			return (l == x) ? r : l;
		}
		int len = D * (r - l + 1);
		if(r - len + 1 > x) {
			int y = query(l, r - len);
			if(y == x) {
				r = r - len;
			}
			else {
				return solve(r - len + 1, r);
			}
		}
		else {
			int y = query(l + len, r);
			if(y == x) {
				l = l + len;
			}
			else {
				return solve(l, l + len - 1);
			}
		}
	}
	
}
void work(){
	cin >> n; 
	int pos = solve(1, n);
	ans(pos);
}


int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> T;
	while(T--){
		work();
	}	
	return 0;
}