#include <bits/stdc++.h>

using namespace std;

const int N = 1005;

int n, used[N][N];

bool qry(int x, int y){
    cout << "? " << x << ' ' << y << endl;
    int t; cin >> t;
    return t;
}

bool answer(int x, int y){
    cout << "! " << x << ' ' << y << endl;
    int t; cin >> t;
    return t == 1;
}

void solve(int xl, int xr, int yl, int yr){
    if (xl == xr && yl == yr){
        assert(answer(xl - 1, yl - 1));
        return;
    }

    if (xr - xl > yr - yl){
        int mid = xl + xr >> 1;
        for (int y = yl; y < yr; ++ y){
            int op = qry(mid, y);
            for (int r : {mid, mid + 1}){
                for (int c : {y, y + 1}) used[r][c] |= op;
            }
        }

        int statel = 0;
        for (int x = xl; x <= mid; ++ x){
            for (int y = yl; y <= yr; ++ y) statel ^= (!used[x][y]);
        }

        if (statel) solve(xl, mid, yl, yr);
        else solve(mid + 1, xr, yl, yr);

        return;
    }

    int mid = yl + yr >> 1;
    for (int x = xl; x < xr; ++ x){
        int op = qry(x, mid);
        for (int r : {x, x + 1}){
            for (int c : {mid, mid + 1}) used[r][c] |= op;
        }
    }

    int statel = 0;
    for (int x = xl; x <= xr; ++ x){
        for (int y = yl; y <= mid; ++ y) statel ^= (!used[x][y]);
    }

    if (statel) solve(xl, xr, yl, mid);
    else solve(xl, xr, mid + 1, yr);
}

void process(){
    cin >> n;
    if (n & 1){
        answer(-1, -1);
        return;
    }
    for (int i = 1; i <= n + 1; ++ i){
        for (int j = 1; j <= n + 1; ++ j) used[i][j] = 0;
    }

    solve(1, n + 1, 1, n + 1);
}

int main(){
    int t; cin >> t;
    while (t --) process();

    return 0;
}