/*
Author:
Homework:QH01
Problem:identify
Time:2025 - 1 - 30
Calm down!
Think twice and type.
*/
#include<bits/stdc++.h>
#define REP(i,l,r) for(int i=(l);i<=(r);i++)
#define PER(i,r,l) for(int i=(r);i>=(l);i--)
#define pi pair<int,int>
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define ll long long
#define lc tr[i].ch[0]
#define rc tr[i].ch[1]
#define Lc tr[j].ch[0]
#define Rc tr[j].ch[1]
#define lowbit(i) (i&(-i))
using namespace std;
inline int read(){
    int x=0,f=1;
    char c=getchar();
    while(!isdigit(c)){
        if(c=='-')f=-1;
        c=getchar();
    }
    while(isdigit(c)){
        x=(x<<3)+(x<<1)+c-'0';
        c=getchar();
    }
    return x*f;
}
void write(int x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
int getrand(int mod){
    ll x=0;
    x<<=15,x+=rand();
    x<<=15,x+=rand();
    x<<=15,x+=rand();
    return x%mod+1;
}
int query(int x,int y){
    putchar('?'),putchar(' ');
    write(x),putchar(' ');
    write(y),putchar('\n');
    fflush(stdout);
    return read();
}
void print(int x,int y){
    putchar('!'),putchar(' ');
    write(x),putchar(' ');
    write(y),putchar('\n');
    fflush(stdout);
    int res=read();
    if(res==-1)exit(0);
}
int n,ans;
bool check(int x,int y){
    if(y<x)swap(x,y);
    int dis=min(y-x,x+n-y);
    ans=query(x,y);
    return ans!=dis;
}
void solve(){
    n=read();
    int x=getrand(n),y=x+1+getrand(n-3);if(y>n)y-=n;
    while(!check(x,y)){
        x=getrand(n),y=x+1+getrand(n-3);
        if(y>n)y-=n;
    }
    if(x>y)swap(x,y);
    bool dirx=0,diry=0;
    if(query(x%n+1,y)==ans-1)dirx=1;
    if(query(x,y%n+1)==ans-1)diry=1;
    if(dirx){
        int l=x+1,r=y-1,res=x;
        while(l<=r){
            int mid=(l+r)/2;
            if(query(mid,y)==ans-(mid-x))res=mid,l=mid+1;
            else r=mid-1;
        }
        ans-=res-x+1,x=res;
    }else{
        int l=y+1,r=n+x-1,res=n+x;
        while(l<=r){
            int mid=(l+r)/2;int v=mid;if(v>n)v-=n;
            if(query(v,y)==ans-(n+x-mid))res=mid,r=mid-1;
            else l=mid+1;
        }
        ans-=(n+x)-res+1,x=res;
    }
    if(diry)y+=ans;
    else y+=n-ans;
    if(x>n)x-=n;
    if(y>n)y-=n;
    print(x,y);
}
int main(){
    srand(time(0));
    // freopen("identify.in","r",stdin);
    // freopen("identify.out","w",stdout);
    int T=read();
    while(T--)solve();
    return 0;
}