#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

int N;
int sum = 0;
int cnt = 0;
int QUERY;

	
map<PII, int> res;
int ask(int l, int r)
{
	if (l >= r)
		return -1;
	if(res.count(MP(l, r)))
		return res[MP(l, r)];

	cnt++;
	sum += (r - l + 1);
	//assert(sum <= 3 * N);
	//assert(cnt <= QUERY);
	cout << "? " << l + 1 << ' ' << r + 1 << endl;
	int x;
	cin >> x;
	return res[MP(l, r)] = x - 1;
}

int solve(int l, int r)
{
	if (l + 1 == r)
		return l + 1;
	if (l + 2 == r)
	{
		int x = ask(l, l + 1);
		return 2 * l + 1 - x + 1;
	}
	if(l + 3 == r)
	{
		int x = ask(l, l + 2);
		if(x == l + 1)
		{
			if(ask(l, x) == x)
				return l + 1;
			return solve(l + 1, r);	
		}
		if(x == l)
			return solve(l + 1, r);
		return solve(l, r - 1);
	}
	
	
	int n = r - l;
	VI sz(3, n / 3);
	int rem = n % 3;
	FOR (i, 0, rem)
		sz[i]++;
	int x = ask(l, r - 1);
	
	if (x <= l + 1)
		reverse(ALL(sz));
	if (x < l + sz[0])
	{
		int y = ask(l, l + sz[0] - 1);
		if (x == y)
			return solve(l, l + sz[0]);
		y = ask(x, l + sz[0] + sz[1] - 1);
		if (x == y)
			return solve(l + sz[0], l + sz[0] + sz[1]);
		return solve(l + sz[0] + sz[1], r);
	}
	if (x < l + sz[0] + sz[1])
	{
		int y = ask(l + sz[0], l + sz[0] + sz[1] - 1);
		if (x == y)
			return solve(l + sz[0], l + sz[0] + sz[1]);
		
		if(r - x < x - l + 1)
		{
			y = ask(x, r - 1);
			if (x == y)
				return solve(l + sz[0] + sz[1], r);
			return solve(l, l + sz[0]);
		}
		else
		{
			y = ask(l, x);
			if (x == y)
				return solve(l, l + sz[0]);
			return solve(l + sz[0] + sz[1], r);			
		}
	}
	else
	{
		int y = ask(l + sz[0] + sz[1], r - 1);
		if (x == y)
			return solve(l + sz[0] + sz[1], r);
		y = ask(l + sz[0], x);
		if (x == y)
			return solve(l + sz[0], l + sz[0] + sz[1]);
		return solve(l, l + sz[0]);
	}
}

void solve()
{
	int n;
	cin >> n;
	N = n;
	sum = 0;
	cnt = 0;
	res.clear();
	QUERY = ceil(1.5 * log(n) / log(2));
	int ans = solve(0, n);
	cout << "! " << ans << endl;
}

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

	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}

	return 0;
}