#include <bits/stdc++.h>
#define _for(i, a, b) for (int i = a; i <= b; ++i)
#define for_(i, a, b) for (int i = a; i >= b; --i)
#define far(i, vec) for (auto i : vec)
#define bdmd int mid = (l + r) >> 1
typedef long double ldb;
typedef long long ll;
typedef double db;
typedef std::pair <int, int> pii;
typedef std::pair <ll, ll> pll;
const int N = 1e5 + 10, P = 998244353;
namespace IO {
	int rnt () {
		int x = 0, w = 1; char c = getchar ();
		while (!isdigit (c)) { if (c == '-') w = -1; c = getchar (); }
		while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
		return x * w;
	}
} // namespace IO
namespace SOLVE {
	using namespace IO;
	int n, a[N], ans;
	int Que (int u, int v) {
		std::cout << "? " << u + 1 << " " << v + 1 << std::endl;
		int dist; std::cin >> dist;
		return dist;
	}
	void Ans (int u, int v) {
		std::cout << "! " << u + 1 << " " << v + 1 << std::endl;
		int corr; std::cin >> corr;
		return;
	}
	int Dis (int u, int v) {
		int d = std::abs (u - v);
		return std::min (d, n - d);
	}
	void Main () {
		std::cin >> n;
		int S = 0, T = n / 2, D = Que (S, T);
		while (Dis (S, T) == D) {
			if (!(n & 1))
				++S, ++T;
			else {
				if (T - S == n / 2)
					++T;
				else
					++S;
			}
			S %= n, T %= n, D = Que (S, T);
		}
		int p = (T + n - 1) % n, pd = Que (S, p);
		int q = (T + 1) % n, qd = Que (S, q);
		if (pd != Dis (S, p) && pd < D) {
			int L = S, R = p;
			while (L <= R) {
				int mid = (L + R) / 2;
				if (T - mid == D - Que (S, mid))
					R = mid - 1;
				else
					L = mid + 1;
			}
			D -= T - L + 1;
			Ans (S + D, L);
		}
		else if (qd != Dis (S, q) && qd < D) {
			int L = q, R = S + n;
			while (L <= R) {
				int mid = (L + R) / 2;
				if (mid - T == D - Que (S, mid % n))
					L = mid + 1;
				else
					R = mid - 1;
			}
			D -= R - T + 1;
			Ans ((S + n - D) % n, R % n);
		}
		else {
			--D;
			if (D == 0)
				Ans (S, T);
			else if (Que (S + D, T) == 1 && Dis (S + D, T) != 1)
				Ans (S + D, T);
			else
				Ans ((S + n - D)%n, T);
		}
		return;
	}
}
int main () {
	std::ios::sync_with_stdio (false);
	std::cin.tie (0), std::cout.tie (0);
	int T;
	std::cin >> T;
	while (T--)
		SOLVE::Main ();
	return 0;
} /*

*/