#include <bits/stdc++.h>
using namespace std;
#define int long long
mt19937_64 rng(time(0));
template <class T, class ... A> void debug(T t, A ... a) {
    cerr << "[" << t, ((cerr << ", " << a), ...), cerr << "]\n";
}

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

    vector<int> a(n + 1);

    auto query = [&](int l, int r, int x = -1) {
        cout << "? " << l << " " << r << endl;
        return cin >> x, x;
    };
    
    auto answer = [&](int n) {
        cout << "! " << n << endl;
    };

    int lst = query(1, n);

    auto F = [&](auto && self, int l, int r) {
        if (l >= r) return answer(l);
        if (l + 1 == r) {
            if (l == lst) return answer(r);
            else return answer(l);
        }
        int m = l + (r - l) * 0.6, tmp;
        if (m == r) m--;
        if (l + 2 == r) {
            m = l;
            tmp = query(m + 1, r);
            if (l == lst) {
                if (tmp == r) return answer(m + 1);
                else return answer(r);
            } else {
                if (tmp == lst) return answer(tmp == r ? r - 1 : r);
                else return answer(l);
            }
        }
        if (lst <= m) {
            tmp = query(l, m);
            if (lst == tmp) return self(self, l, m);
            else {
                if (m + 1 == r) {
                    return answer(r);
                }
                lst = query(m + 1, r);
                return self(self, m + 1, r);
            }
        } else {
            m = r - 0.6 * (r - l);
            tmp = query(m + 1, r);
            if (lst == tmp) return self(self, m + 1, r);
            else {
                if (l == m) {
                    return answer(l);
                }
                lst = query(l, m);
                return self(self, l, m);
            }
        }
    };

    F(F, 1, n);
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int t = 1;
    cin >> t;
    for (cout << fixed << setprecision(12); t--; QAQ());
}