#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;

// a,b : 0-indexed
i64 query(i64 a, i64 b);

// a,b : 0-indexed
i64 answer(i64 a, i64 b);

#ifdef RANTES
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 INFL = (1ll << 31);
random_device seed_gen;
mt19937_64 engine(seed_gen());
i64 randint(i64 min, i64 max) {
    assert(min <= max);
    return engine() % (max - min + 1) + min;
}
vector<i64> randvec(int n, i64 min, i64 max) {
    vector<i64> rev(n);
    for (int i=0; i<n; i++) { rev[i] = randint(min, max); }
    return rev;
}
vector<i64> p;
i64 u,v;
vector<vector<i64>> dist;
i64 query(i64 a, i64 b) {
    //cout << "query " << a << " " << b <<  " -> " << dist[a][b] << endl;
    return dist[a][b];
}
i64 answer(i64 a, i64 b) {
    if(!((a == u && b == v) || (a == v && b == u))){
        cout << p.size() << " " << u << " " << v << endl;
        return -1;
    }
    return 1;
}
#else

i64 query(i64 a, i64 b){
    cout << "? " << (a+1) << " " << (b+1) << "\n";
    cout.flush();
    i64 x; cin >> x;
    return x;
}
i64 answer(i64 a, i64 b){
    cout << "! " << (a+1) << " " << (b+1) << "\n";
    cout.flush();
    i64 x; cin >> x;
    return x;
}
#endif

i64 testcase(i64 N){
    i64 x = 0;
    i64 y = 0;
    auto tr = [&](i64 s) -> int {
        if(y) s = (N - s) % N;
        s = (s+x)%N;
        return s;
    };
    auto query_x = [&](i64 s, i64 t) -> i64 {
        s = tr(s);
        t = tr(t);
        if(s > t) swap(s, t);
        return query(s, t);
    };
    auto answer_x = [&](i64 s, i64 t) -> i64 {
        s = tr(s);
        t = tr(t);
        if(s > t) swap(s, t);
        return answer(s, t);
    };
    while(true){
        i64 a = 0;
        i64 b = N/2;
        i64 dab = 0;
        if(N % 2 == 0){
            dab = query_x(a, b);
            if(dab == N/2){ x++; continue; }
        } else {
            dab = query_x(a, b);
            if(dab == N/2){
                b++;
                dab = query_x(a, b);
                if(dab == N/2){ x++; continue; }
            }
        }
        //cout << "##" << endl;
        if(dab == 1) return answer_x(a, b);
        //cout << "##" << endl;
        if(query_x((a+N-1)%N, b) < dab){
            b = (b + 1) % N;
            b = (N - b) % N;
            y = 1;
            x += N - 1; x %= N;
            dab--;
        }
        //cout << "##" << endl;
        i64 ng = dab+1, ok = 0;
        while(ok + 1 < ng){
            i64 mid = (ok + ng) / 2;
            if(query_x(mid, b) + mid != dab){
                ng = mid;
            } else ok = mid;
        }
        //cout << "a = " << a << " , b = " << b << " , x = " << x << " , y = " << y << " , ok = " << ok << endl;
        //rep(i,N){ cout << tr(i) << " "; } cout << endl;
        //cout << "##" << endl;
        if(abs(ok - (b - (dab-ok) + 1)) != 1 && query_x(ok, b - (dab-ok) + 1) == 1){
            return answer_x(ok, b - (dab-ok) + 1);
        }
        return answer_x(ok, b + (dab-ok) - 1);
    }
}

#ifdef RANTES
i64 test2(i64 N, i64 u, i64 v) {
    //cout << N << " " << u << " " << v << endl;
    ::u = u;
    ::v = v;
    dist = vector(N, vector<i64>(N, INFL));
    p.assign(N, 0);
    for(int i=0; i<N; i++) p[i] = i;
    for(int i=0; i<N; i++) dist[i][i] = 0;
    for (int i=0; i<N; i++) {
        dist[p[i]][p[(i+1)%N]]  = 1;
        dist[p[(i+1)%N]][p[i]]  = 1;
    }
    dist[u][v] = 1;
    dist[v][u] = 1;
    for (int k=0; k<N; k++) for (int i=0; i<N; i++) for (int j=0; j<N; j++) {
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
    }
    return testcase(N);
}

void test() {
    i64 N = randint(4, 20);
    u = randint(0, N-1);
    v = (u + randint(0, N-4) + 2) % N;
    test2(N, u, v);
}
#endif

int main(){
    //ios::sync_with_stdio(false); cin.tie(nullptr);
#ifdef RANTES
    i64 do_test = 1;
    if(do_test == 1){
        rep(i,100){
            test();
        }
    } else if(do_test == 2) {
        int T; cin >> T;
        rep(t,T){
            i64 N, u, v; cin >> N >> u >> v;
            test2(N, u, v);
        }
    } else {
#endif
        int T; cin >> T; rep(t,T){
            i64 N; cin >> N;
            if(testcase(N) == -1) break;
        }
#ifdef RANTES
    }
#endif
    return 0;
}