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

int query(int l, int r) {
    cout << "? " << l << ' ' << r << endl;
    int res;
    cin >> res;
    return res;
}

void solve() {
    int n;
    cin >> n;
    int l = 1, r = n;
    int k = query(1, n);
    while (r-l > 1) {
        if (k < (l+r)/2) {
            int m = l + max((r-l)/3*2, 1);
                if (k <= m) {
                int nk = query(l, m);
                if (k == nk) r = m;
                else l = m+1, k = nk;
            } else {
                l += max((r-l)/3, 1);
                k = query(l, r);
            }
        } else {
            int m = r - max((r-l)/3*2, 1);
                if (k >= m) {
                int nk = query(m, r);
                if (k == nk) l = m;
                else r = m-1, k = nk;
            } else {
                r -= max((r-l)/3, 1);
                k = query(l, r);
            }
        }
    }
    if (l == r) {
        cout << "! " << l << endl;
    } else {
        cout << "! " << (l == k ? r : l) << endl;
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int t;
    cin >> t;
    for (; t; t--) solve();

    return 0;
}