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

int query(int l, int r){
    if(r == l) return 0;
    cout << "? " << l << ' ' << r << endl;
    int pos;
    cin >> pos;
    return pos;
}

void solve(){
    int n;
    cin >> n;
    int l = 1, r = n;
    int pos = query(1, n);
    long double k = (-1 + sqrt(5)) / 2.0;
    while(l < r){
        if(l + 1 == r){
            if(pos == r) break;
            l = r;
            break;
        }
        if(l + 2 == r){
            if(l == pos){
                int uwu = query(l, l + 1);
                if(uwu == pos){
                    l = r = l + 1;
                }
                else{
                    l = r = l + 2;
                }
            }
            else if(l + 1 == pos){
                int uwu = query(l, l + 1);
                if(uwu == pos){
                    l = r = l;
                }
                else{
                    l = r = l + 2;
                }
            }
            else{
                int uwu = query(l + 1, l + 2);
                if(uwu == pos){
                    l = r = l + 1;
                }
                else{
                    l = r = l;
                }
            }
            break;
        }
        int mid = (l + r) / 2;
        if(pos >= mid){
            int md = (int)(r - (long double)(r - l) * k);
            int ree = query(md, r);
            if(ree == pos) l = md;
            else{
                pos = query(l, md - 1);
                r = md - 1;
            }
        }
        else{
            int md = (int)(l + (long double)(r - l) * k);
            int ree = query(l, md);
            if(ree == pos) r = md;
            else{
                pos = query(md + 1, r);
                l = md + 1;
            }
        }
    }
    cout << "! " << l << endl;
}

int main(){
    //ios_base::sync_with_stdio(0);
    //cin.tie(0);
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}