#include <bits/stdc++.h>
#define ll long long

using namespace std;
ll n;
map<pair<int, int>, int> mp;

ll qry(int u, int v, bool flip) {
    if(flip) u = n - u % n, v = n - v % n;
    u = (u - 1) % n + 1, v = (v - 1) % n + 1;
    if(mp.count({u, v})) return mp[{u, v}];
    cout << "? " << u << " " << v << endl;
    ll ret; cin >> ret; mp[{u, v}] = ret;
    return ret;
}

void slv() {
    mp.clear(), cin >> n;
    ll mid = n / 2, u = 1, v = mid + 1, cur = 0;
    bool flip = false;
    while((cur = qry(u, v, flip)) == mid) 
        if(n & 1) {
            if(u + mid < v) u++;
            else v++;
        } else if(n % 2 == 0) u++, v++;
    if(qry(u, v + 1, flip) == cur - 1) {
        flip = true;
        u = n - u;
        v = 2 * n - v;
    }
    ll l = u, r = v;
    while(l <= r) {
        ll t = (l + r) >> 1;
        if(qry(u, t, flip) == cur - v + t) r = t - 1;
        else l = t + 1; 
    }
    cur -= v - l + 1;
    if(qry(n + u - cur, l, flip) == 1) {
        ll ansu = n + u - cur, ansv = l;
        if(flip) ansu = n - u % n, ansv = n - v % n;
        ansu = (ansu - 1) % n + 1, ansv = (ansv - 1) % n + 1;
        cout << "! " << ansu << " " << ansv << endl;
        ll ret; cin >> ret;
    } else {
        ll ansu = u + cur, ansv = l;
        if(flip) ansu = n - u % n, ansv = n - v % n;
        ansu = (ansu - 1) % n + 1, ansv = (ansv - 1) % n + 1;
        cout << "! " << ansu << " " << ansv << endl;
        ll ret; cin >> ret;
    }
    return ;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int tc; cin >> tc;
    while(tc --) slv();
    return 0;
}