#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;

const double phi = (std::sqrt(5) - 1) / 2;

int query(int l, int r) {
    std::cout << "? " << l + 1 << " " << r << std::endl;
    int p;
    std::cin >> p;
    return p - 1;
}

void solve() {
    int n;
    std::cin >> n;
    
    int l = 0, r = n;
    int x = -1;
    while (r - l - (x != -1) > 1) {
        if (x == -1) {
            x = query(l, r);
        } else {
            int len = std::ceil((r - l) * phi);
            if (x < l + len) {
                if (query(l, l + len) == x) {
                    r = l + len;
                } else {
                    l = l + len;
                    x = -1;
                }
            } else {
                if (query(r - len, r) == x) {
                    l = r - len;
                } else {
                    r = r - len;
                    x = -1;
                }
            }
        }
    }
    
    int p;
    if (r - l == 1) {
        p = l;
    } else {
        p = l + l + 1 - x;
    }
    std::cout << "! " << p + 1 << std::endl;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}