#include<bits/stdc++.h>
using namespace std;
int n;
int query(int x, int y)
{
	cout << "? " << x % n + 1 << ' ' << y % n + 1 << endl;
	int d;
	cin >> d;
	return d;
}
void solve()
{
	cin >> n;
	int x = 0, y = n / 2, d;
	for(int t = 0; ; t ^= 1)
	{
		d = query(x, y);
		if(d < n / 2) break;
		if(n & 1) x += (t == 1), y += (t == 0);
		else x++, y++;
	}
	int dis = query((x + n - 1) % n, y), X, disy;
	if(dis < d)
	{
		int l = 1, r = n / 2, ans = 1, mid;
		while(l <= r)
		{
			mid = (l + r) >> 1;
			if(query((x + n - mid) % n, y) == d - mid) ans = mid, l = mid + 1;
			else r = mid - 1;
		}
		X = (x + n - ans) % n;
		disy = d - ans - 1;
	}
	else
	{
		dis = query((x + 1) % n, y);
		if(dis < d)
		{
			int l = 1, r = n / 2, ans = 1, mid;
			while(l <= r)
			{
				mid = (l + r) >> 1;
				if(query((x + ans) % n, y) == d - mid) ans = mid, l = mid + 1;
				else r = mid - 1;
			}
			X = (x + ans) % n;
			disy = d - ans - 1;
		}
		else X = x, disy = d - 1;
	}
	int Y = (y + disy) % n;
	if(query(X, Y) != 1) Y = (y + n - disy) % n;
	cout << "! " << X + 1 << ' ' << Y + 1 << endl;
	cin >> X;
}
signed main()
{
	int T;
	cin >> T;
	while(T--) solve();
	return 0;
}