#include <bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

const double rat = 0.618;


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

int solve (int n) {
    int ioslv = query (1, n);
    int l = 1;
    int r = n;
    while (r - l > 2) {
        int mid;

        if (ioslv <= l + (r - l)* rat) {
            mid = int(l + r * rat);
            if (query (l, mid) == ioslv) {
                r = mid;
            }
            else {
                l = mid + 1;
                ioslv = query (l, r);
            }
        }
        else {
            mid = int(r - (r - l) * rat);
            if (query(mid, r) == ioslv) {
                l = mid + 1;
            }
            else {
                r = mid;
            }
        }
    }

    if (l == r - 1) {
        if (ioslv == l) {
            return r;
        }
        return l;
    }

    if (l == ioslv) {
        if (query(r - 1, r) == r) {
            return r - 1;
        }
        return r;
    }

    if (r == ioslv) {
        if (query (l, l + 1) == l) {
            return l + 1;
        }
        return l;
    }
}


int main() {
    fastio;
    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        int ans = solve(N);
        cout << "! " << ans << endl;
    }
}