#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> p) {
    out << "(" << p.first << "," << p.second << ")";
    return out;
}
template <typename T>
ostream& operator<<(ostream& out, vector<T> v) {
    out << "[";
    if (!v.empty()) {
        cout << v[0];
        for (int i = 1; i < v.size(); i++) cout << "," << v[i];
    }
    out << "]";
    return out;
}
#define int long long
const bool gen = false;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int B = 2e9) { return (unsigned long long)rng() % B; }
struct Interator {
    int n, sx, sy, query_cnt = 0;
    int dis(int x, int y) { return min(abs(x - y), n - abs(x - y)); }
    void init(int _n, int _sx = 0, int _sy = 0) {
        n = _n;
        query_cnt = 0;
        if (!gen) return;
        sx = _sx, sy = _sy;
        while (dis(sx, sy) <= 1) {
            sx = rnd() % n, sy = (sx + n / 2 + rnd() % max(10ll, n / 5)) % n;
        }
        cout << "n=" << n << " sx=" << sx << " sy=" << sy << endl;
    }
    int query(int x, int y) {
        cout << "? " << x + 1 << " " << y + 1 << endl;
        query_cnt++;
        assert(query_cnt <= 40);
        assert(dis(x, y) > 1);
        if (gen) {
            return min({dis(x, y), dis(x, sx) + dis(sy, y) + 1,
                        dis(x, sy) + dis(y, sx) + 1});
        } else {
            int z;
            cin >> z;
            return z;
        }
    }
    void answer(int x, int y) {
        cout << "! " << x + 1 << " " << y + 1 << endl;
        if (gen) {
            assert(sx ^ sy ^ x ^ y == 0);
        } else {
            int z;
            cin >> z;
            if (z != 1) exit(0);
        }
    }
} sol;
bool test = true;
void solve() {
    int n;
    if (!gen) {
        cin >> n;
        sol.init(n);
    } else {
        n = 1000000000;
        // n = rnd() % 100 + 4;
        sol.init(n, rnd() % n, rnd() % n);
    }
    auto dis = [&](int x, int y) { return min(abs(x - y), n - abs(x - y)); };
    auto pre = [&](int x) { return (x - 1 + n) % n; };
    auto nxt = [&](int x) { return (x + 1) % n; };
    int x = rnd() % n, y = (x + n / 2) % n;
    int nowd = sol.query(x, y);
    int t = 0;
    while (dis(x, y) == nowd) {
        x = (x + n / 4) % n;
        y = (y + n / 4) % n;
        t++;
        nowd = sol.query(x, y);
    }
    // if (test) cout << "getmain x=" << x << " y=" << y << endl;
    if (nowd == 1) {
        sol.answer(x, y);
        return;
    }
    if (sol.query(pre(x), y) == nowd - 1) {
        int l = 2, r = nowd - 1, res = 1;
        while (l <= r) {
            int mid = (l + r) / 2;
            if (sol.query((x - mid + n) % n, y) == nowd - mid) {
                res = mid;
                l = mid + 1;
            } else
                r = mid - 1;
        }
        x = (x - res + n) % n;
        nowd -= res;
    } else if (sol.query(nxt(x), y) == nowd - 1) {
        int l = 2, r = nowd - 1, res = 1;
        while (l <= r) {
            int mid = (l + r) / 2;
            if (sol.query((x + mid) % n, y) == nowd - mid) {
                res = mid;
                l = mid + 1;
            } else
                r = mid - 1;
        }
        x = (x + res) % n;
        nowd -= res;
    }
    if (nowd == 1) {
        sol.answer(x, y);
        return;
    }
    if (int z = sol.query(x, nxt(y)); z == nowd - 1) {
        y = (y + nowd - 1) % n;
    } else {
        y = (y - nowd + 1 + n) % n;
    }
    sol.answer(x, y);
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    while (T--) solve();
    return 0;
}