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

int T, n, dis, res;
int query(int x, int y) {
	x = (x - 1) % n + 1, y = (y - 1) % n + 1;
	cout << "? " << x << " " << y << endl;
	int tmp; cin >> tmp;
	return tmp;
}
void ans(int x, int y) {
	cout << "! " << x << " " << y << endl;
	cin >> res;
	if (res == -1) exit(0);
}
int getx(int x, int y) {
	int l = x, r = y, ret = -1;
	if (l > r) r += n;
	while (l <= r) {
		int mid = (l + r) >> 1;
		if (query(mid, y) == dis - (mid - x)) ret = mid, l = mid + 1;
		else r = mid - 1;
	}
	return ret;
}
void solve1(int x, int y) {
	int retx = getx(x, y), rety = -1;
	int l = retx, r = y;
	if (l > r) r += n;
	while (l <= r) {
		int mid = (l + r) >> 1;
		if (query(x, mid) == dis - (y - mid + n) % n) rety = mid, r = mid - 1;
		else l = mid + 1;
	}
	ans(retx, rety);
}
void solve2(int x, int y) {
	int retx = getx(x, y), rety = -1;
	int l = y, r = x;
	if (l > r) r += n;
	while (l <= r) {
		int mid = (l + r) >> 1;
		if (query(x, mid) == dis - (mid - y)) rety = mid, l = mid + 1;
		else r = mid - 1; 
	}
	ans(retx, rety);
}
bool work(int x, int y) {
	dis = query(x, y);
	if (dis == n / 2) return false;
	bool dx = query(x + 1, y) == dis - 1;
	bool dy = query(x, y + 1) == dis - 1;
	if (dx && !dy) solve1(x, y);
	else if (!dx && dy) solve1(y, x);
	else if (dx && dy) solve2(x, y);
	else solve2(y, x);
	return true;
}

int main() {
	cin >> T;
	while (T--) {
		cin >> n;
		int x = 1, y = x + n / 2;
		while (!work(x, y)) {
			if (n & 1) {
				if ((y - x + n) % n == n / 2 + 1) x = x % n + 1;
				else y = y % n + 1;
			} else x = x % n + 1, y = y % n + 1;
		}
	}
	return 0;
}