#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf INT_MAX
#define FF fflush(stdout)
#define fr(i,l,r) for (i=(l); i<=(r); i++)
#define rfr(i,l,r) for (i=(l); i>=(r); i--)
template<typename T>inline void read(T &n){
    T w=1; n=0; char ch=getchar();
    while (!isdigit(ch) && ch!=EOF){ if (ch=='-') w=-1; ch=getchar(); }
    while (isdigit(ch) && ch!=EOF){ n=(n<<3)+(n<<1)+(ch&15); ch=getchar(); }
    n*=w;
}
template<typename T>inline void write(T x){
    if (x==0){ putchar('0'); return ; }
    T tmp;
    if (x>0) tmp=x;
    else tmp=-x;
    if (x<0) putchar('-');
    char F[105];
    long long cnt=0;
    while (tmp){
        F[++cnt]=tmp%10+48;
        tmp/=10;
    }
    while (cnt) putchar(F[cnt--]);
}
#define Min(x,y) x = min(x,y)
#define Max(x,y) x = max(x,y)
//基础配置=================================================================================
const bool flag = true;
ll n, ans;
struct grader{
    ll cnt, n,x,y;
    ll N(){ return n; }
    ll dis(ll x,ll y){ return min(abs(x-y),n-abs(x-y)); }
    void init(){ cnt = 0; read(n), read(x), read(y); }
    ll qry(ll l,ll r){
        cnt++;
        if (cnt>40){ printf("To many query !!!\n"); exit(0); }
        ll ans = dis(l,r);
        Min( ans , dis(l,x) + 1 + dis(y,r) );
        Min( ans , dis(l,y) + 1 + dis(x,r) );
        printf("qry %lld %lld = %lld\n",l,r,ans);
        return ans;
    }
    void answer(ll l,ll r){
        if (l==x && r==y){ printf("OK : %lld %lld\n",x,y); return ; }
        if (l==y && r==x){ printf("OK : %lld %lld\n",x,y); return ; }
        printf("Wrong : get %lld %lld , expected %lld %lld\n",l,r,x,y); exit(0);
    }
}gr;
ll qry(ll x,ll y){
    while (x>n) x -= n;
    while (y>n) y -= n;
    while (x<1) x += n;
    while (y<1) y += n;
    if (flag){
        printf("? %lld %lld\n",x,y), FF;
        read(ans); return ans;
    }
    else return ans = gr.qry(x,y);
}
void print(ll x,ll y){
    while (x>n) x -= n;
    while (y>n) y -= n;
    while (x<1) x += n;
    while (y<1) y += n;
    if (flag){
        printf("! %lld %lld\n",x,y), FF;
        read(ans); return ;
    }
    else gr.answer(x,y);
}
ll To(ll x,ll y,ll d){
    while (x>y) y += n;
    if (d==1) return y-x;
    else return n-(y-x);
}
void work(){
    if (!flag) gr.init(), n = gr.N();
    else read(n);
    ll x = 1, y = n/2 + 1;
    while (qry(x,y)==n/2){
        if (n&1){ if (qry(x,y+1)!=n/2){ y++, swap(x,y); break; } }
        x++, y++;
    }
    x = (x-1)%n+1, y = (y-1)%n+1;
    ll k = qry(x,y);
    if (ans==1){ print(x,y); return ; }
    // if (To(x,y)==n/2){
        // if (qry(x+1,y)==k || qry(x,y-1)==k) swap(x,y);
    // }
    // printf("x,y = %lld,%lld\n",x,y);
    ll d = 1; if (qry(x-1,y)==k-1) d = -1;
    // if (x<y){
        // if (qry(x+1,y)!=k-1 && qry(x,y-1)!=k-1) swap(x,y);
    // }
    // else{
        // if (qry())
    // }
    // printf("%lld %lld , k = %lld , d = %lld\n",x,y,k,d);
    // if (qry(x,y-k+1)==1){ print(x,y-k+1); return ; }
    // if (qry(x+k-1,y)==1){ print(x+k-1,y); return ; }
    ll l = x, r = y, mid, p = l;// while (l>r) r += n;
    if (d==1) l = x, r = y; else l = y, r = x; while (l>r) r += n;
    // else { }
    // printf("l = %lld , r = %lld , k = %lld\n",l,r,k);
    while (l<=r){
        // printf("\nl = %lld , r = %lld\n",l,r);
        mid = (l+r)>>1;
        if (qry(mid,y)==k-To(x,mid,d)){
            p = mid;
            if (d==1) l = mid+1;
            else r = mid-1;
            // l = mid+1, p = mid;
        }
        else{
            if (d==1) r = mid-1;
            else l = mid+1;
            // r = mid-1;
        }
    }
    // printf("p = %lld\n",p);
    // ll p2 = ;
    // if (d==1) 
    // p2 = y - (k-1-To(x,p,d));
    // else p2 = y + (k-1-To(x,p,d));
    ll p2 = y - (k-1-To(x,p,d));
    if (qry(p,p2)!=1) p2 = 2*y-p2;
    l = p, r = p2;
    // l = p, r = y - (qry(l,y)-1);
    print(l,r); return ;
}
int main(){
	// freopen("a.in","r",stdin);
//	freopen(".out","w",stdout);
    ll qt; read(qt);
    while (qt--) work();
    return 0;
}
//g++ a.cpp -o a -Wall -Wl,--stack=512000000 -std=c++11 -O2