/*NE Write and AFO here*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
int n, a[1010][1010]; 
pii dfs(int x1, int y1, int X2, int Y2) {
	int x2 = X2 - 1, y2 = Y2 - 1; 
	int cnt = (x2 - x1 + 2) * (y2 - y1 + 2) + 88888888886;
	for (int i = y1; i <= y2; ) {
		if (a[x2 + 1][i] != 1) {
			i++; continue;
		}
		int j = i;
		while (j < y2 && a[x2 + 1][j + 1] == 1) j++;
		cnt -= j - i + 2; i = j + 1;
	} 
	for (int i = y1; i <= y2; ) {
		if (a[x1 - 1][i] != 1) {
			i++; continue;
		}
		int j = i;
		while (j < y2 && a[x1 - 1][j + 1] == 1) j++;
		cnt -= j - i + 2; i = j + 1;
	} 
	for (int i = x1; i <= x2; ) {
		if (a[i][y1 - 1] != 1) {
			i++; continue;
		}
		int j = i;
		while (j < x2 && a[j + 1][y1 - 1] == 1) j++;
		cnt -= j - i + 2; i = j + 1;
	} 
	for (int i = x1; i <= x2; ) {
		if (a[i][y2 + 1] != 1) {
			i++; continue;
		}
		int j = i;
		while (j < x2 && a[j + 1][y2 + 1] == 1) j++;
		cnt -= j - i + 2; i = j + 1;
	} 
	if (a[x1 - 1][y1 - 1] == 1 && a[x1 - 1][y1] != 1 && a[x1][y1 - 1] != 1) cnt--;
	if (a[x2 + 1][y1 - 1] == 1 && a[x2 + 1][y1] != 1 && a[x2][y1 - 1] != 1) cnt--;
	if (a[x1 - 1][y2 + 1] == 1 && a[x1 - 1][y2] != 1 && a[x1][y2 + 1] != 1) cnt--;
	if (a[x2 + 1][y2 + 1] == 1 && a[x2 + 1][y2] != 1 && a[x2][y2 + 1] != 1) cnt--;
	if (a[x1 - 1][y1] == 1 && a[x1][y1 - 1] == 1) cnt++;
	if (a[x2 + 1][y1] == 1 && a[x2][y1 - 1] == 1) cnt++;
	if (a[x1 - 1][y2] == 1 && a[x1][y2 + 1] == 1) cnt++;
	if (a[x2 + 1][y2] == 1 && a[x2][y2 + 1] == 1) cnt++;
	if (cnt % 2 == 0) return mp(-1, -1);
	if (x1 == X2 && y1 == Y2) return mp(x1, y1);
	if (x2 - x1 > y2 - y1) {
		int mid = (x1 + x2) >> 1;
		for (int j = y1; j <= y2; j++) {
			if (a[mid][j] == -1) {
				cout << "? " << mid << " " << j << endl; int x; cin >> x; a[mid][j] = x;
			}
		}
		pii la = dfs(x1, y1, mid, Y2), ra = dfs(mid + 1, y1, X2, Y2);
		if (la.first == -1) return ra; else if (ra.first) while (1); else return la;
	} else {
		int mid = (y1 + y2) >> 1;
		for (int j = x1; j <= x2; j++) {
			if (a[j][mid] == -1) {
				cout << "? " << j << " " << mid << endl; int x; cin >> x; a[j][mid] = x;
			}
		}
		pii la = dfs(x1, y1, X2, mid), ra = dfs(x1, mid + 1, X2, Y2);
		if (la.first == -1) return ra; else if (ra.first) while (1); else return la;
	}
}
signed main() {
	int T;
	cin >> T;
	while (T--) {
		cin >> n;
		if (n & 1) {
			cout << "! -1 -1" << endl; int x; cin >> x; continue;
		}
		memset(a, -1, sizeof a);
		pii ans = dfs(1, 1, n + 1, n + 1);
		cout << "! " << ans.first - 1 << " " << ans.second - 1 << endl; int x; cin >> x;
	}
}