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

void solve() {
    int n;
    cin >>n;
    

    auto query = [&](int l, int r) {
        cout << "? " << l << ' ' << r << endl;
        int p;
        cin >> p;
        return p;
    };

    auto answer = [&](int x) {
        cout << "! " << x << endl;
    };

    auto div = [&](auto &&self, int l, int r, int p) -> void {
        if (r - l + 1 == 1) {
            answer(l);
            return;
        }
        if (r - l + 1 == 2) {
            answer(l + r - p);
            return;
        }
        int len = r - l + 1;
        int t = (r - l + 1) / 3;
        t = t * 2;

        if (l + t - 1 >= p) {
            int nxtp = query(l, l + t - 1);
            if (nxtp == p) {
                self(self, l, l + t - 1, p);
            } else {
                if (len - t == 1) {
                    answer(r);
                    return;
                }
                int p1 = query(r - (len - t) + 1, r);
                self(self, r - (len - t) + 1, r, p1);
            }
        } else {
            int nxtp = query(r - t + 1, r);
            if (nxtp == p) {
                self(self, r - t + 1, r, p);
            } else {
                if (len - t == 1) {
                    answer(l);
                    return;
                }
                int p1 = query(l, l + (len - t) - 1);
                self(self, l, l + (len - t) - 1, p1);
            }
        }
    };

    int p = query(1, n);

    div(div, 1, n, p);
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    int t;
    cin >> t;
    while (t--){
        solve();
    }
    return 0;
}