#include <bits/stdc++.h>

using namespace std;

int p[1000005];
int querycnt = 0, length = 0;
int force(int l, int r) {
    querycnt++;
    length += r - l + 1;

    int mx = 0, se = 0;
    for (int i = l; i <= r; i++) {
        if (p[i] >= p[mx]) {
            se = mx;
            mx = i;
        }else if (p[i] > p[se]) {
            se = i;
        }
    }
    return se;
}

int ask(int l, int r) {
    if (l == r) return -1;
    // return force(l, r);
    cout << "? " << l << ' ' << r << endl;
    int p;
    cin >> p;
    return p;
}

constexpr double kkk = 0.58;                                                         

void solve() {
    int n;
    cin >> n;
    int l = 1, r = n;

    // iota(p + 1, p + n + 1, 1);
    // random_shuffle(p + 1, p + n + 1);
    // int pos;
    // for (int i = 1; i <= n; i++) if (p[i] == n) pos = i;

    int se = ask(1, n);
    while (l < r) {
        int m = (l + r) / 2;
        int mid;
        if (se <= m) {
            mid = ceil(l + kkk * double(r - l));
            int nse = ask(l, mid - 1);
            if (nse == se) {
                r = mid - 1;
            }else {
                l = mid;
                se = ask(l, r);
            }
        }else {
            mid = floor(r - kkk * double(r - l));
            int nse = ask(mid + 1, r);
            if (nse == se) {
                l = mid + 1;
            }else {
                r = mid;
                se = ask(l, r);
            }
        }
    }
    // cerr << pos << ' ' << l << "\n";
    // cerr << ceil(1.5 * log2(n))  << ' ' << querycnt << '\n';
    // cerr << 3 * n << ' ' << length << '\n';

    cout << "! " << l << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    srand(time(0));

    int tt;
    cin >> tt;
    while (tt--) {
        solve();
    }
    
    // int l = 1, r = n;
    // int ans = 0;
    // while (l < r) {
    //     int m = (l * 65 + r * 35) / 100;
    //     ans += r - l + 1;
    //     l = m + 1;
    // }
    return 0;
}