#include <bits/stdc++.h>
using namespace std;
int n;
int Query(int a, int b) {
	if (a == b) {
		return 0;
	}
	printf("? %d %d\n", a, b);
	fflush(stdout);
	int v;
	scanf("%d", &v);
	return v;
}
inline int Prev(int a) {
	return (a == 1 ? n : a - 1);
}
inline int Next(int a) {
	return (a == n ? 1 : a + 1);
}
inline int Walk(int a, long long b) {
	return (((long long)a + b) % n + n - 1) % n + 1;
}
random_device rd;
mt19937 mt(rd());
void Solve() {
	scanf("%d", &n);
	int a, b, DIS;
	a = 1, b = 1 + n / 2;
	if (Query(a, b) == n / 2 and n % 2 == 1) {
		b++;
	}
	if (Query(a, b) == n / 2) {
		a++;
		Walk(b, 1);
	}
	DIS = Query(a, b);
	assert(DIS != n / 2);
	int d;
	if (Query(Prev(a), b) == DIS - 1) {
		d = -1;
	}
	else {
		d = 1;
	}
	for (int i = __lg(n) - 1; i >= 0; i--) {
		int A = Walk(a, d * (1 << i));
		int D = Query(A, b);
		if ((1ll << i) + D == DIS) {
			DIS = D;
			a = A;
		}
	}
	if (Query(a, Walk(b, DIS - 1)) == 1) {
		b = Walk(b, DIS - 1);
	}
	else {
		b = Walk(b, 1 - DIS);
	}
	printf("! %d %d\n", a, b);
	fflush(stdout);
	int res;
	scanf("%d", &res);
	if (res == -1) {
		exit(0);
	}
}
signed main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		Solve();
	}
	return 0;
}