#include "bits/stdc++.h"

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

// [l, r)
template<typename T, typename F>
T FindFirstTrue(T l, T r, const F &predicat) {
    --l;
    while (r - l > 1) {
        T mid = l + (r - l) / 2;
        if (predicat(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    return r;
}


template<typename T, typename F>
T FindLastFalse(T l, T r, const F &predicat) {
    return FindFirstTrue(l, r, predicat) - 1;
}

const ll INF = 2e18;
const int INFi = 1e9;

const int LG = 49;
const int N = 1e6 + 6;

int dp[N];
int opt[N];
ll sum[N];

const ld PHI = (sqrtl(5) - 1) / (ld)2;

void precalc() {
    dp[1] = 0;
    dp[2] = 1;
    sum[2] = 2;
    for(int n = 3; n < N; ++n) {
        int m = PHI * n;
        dp[n] = n * 3;
        for(int t = m - 1; t <= m + 1; ++t) {
            if (t <= 1 || t >= n) continue;
            int s = n - t;
            if (t < s) continue;
            int new_dp = 2 + max(dp[t] - 1, dp[s]);
            if (dp[n] > new_dp) {
                dp[n] = new_dp;
                opt[n] = t;
                sum[n] = n + t + max(sum[t] - t, sum[s]);
            }
        }
        ld val = ceil(1.5 * log2(n));
        assert(dp[n] <= val);
        assert(sum[n] <= n * 3);
        assert(opt[n] >= 1 && opt[n] < n);
    }
}

int ask(int l, int r) {
    r--;
    assert(l < r);
    cout << "? " << l << ' ' << r << endl;
    int x; cin >> x;
    return x;
}

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

    int l = 1;
    int r = n + 1;
    int smx = -1;
    while (r - l > 2) {
        if (smx == -1) smx = ask(l, r);
        int m = opt[r - l];

        if (l + m > smx) {
            int val = ask(l, l + m);
            if (val == smx) {
                r = l + m;
                continue;
            }
            l += m;
            smx = -1;
            continue;
        }

        assert(r - m <= smx);
        int val = ask(r - m, r);
        if (val == smx) {
            l = r - m;
            continue;
        }
        r -= m;
        smx = -1;
    }
    if (r - l == 2) {
        if (smx == -1) smx = ask(l, r);
        if (smx == l) l++;
        else {
            assert(smx == r - 1);
            r--;
        }
    }
    cout << "! " << l << endl;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(12) << fixed;
    int t = 1;
    precalc();
    cin >> t;
    rep(i, t) {
        solve();
    }
    return 0;
}