// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

double ra = 0.6;

int query(int a, int b){
	int ret;
	cout << "? " << a << " " << b << endl;
	cin >> ret;
	return ret;
}

int solve(int n){
	int pos = query(1,n);
	int l = 1;
	int r = n;
	while(r-l > 2){
		int mid;
		if(pos <= l+(r-l)*ra){
			mid = r-(r-l)*ra+1;
			if(query(l,mid) == pos){
				r = mid;
			}else{
				l = mid+1;
				pos = query(l,r);
			}
		}else{
			mid = l+(r-l)*ra;
			if(query(mid,r) == pos){
				l = mid;
			}else{
				r = mid-1;
				pos = query(l,r);
			}
		}
	}
	if(l == r+1){
		if(query(l,r) == l){
			return r;
		}
		return l;
	}
	if(l == pos){
		if(query(r-1,r) == r){
			return r-1;
		}
		return r;
	}
	if(r == pos){
		if(query(l,l+1) == l){
			return l+1;
		}
		return l;
	}
	if(l+1 == query(l,l+1)){
		return l;
	}
	return r;
}

int main() {
	int t;
	cin >> t;
	while(t--){
		int n;
		cin >> n;
		cout << "! " << solve(n) << endl;
	}
}