#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)
//基础配置=================================================================================
ll n, ans; 
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;
    printf("? %lld %lld\n",x,y), FF;
    read(ans); return ans;
}
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;
    printf("! %lld %lld\n",x,y), FF;
    return ;
}
ll To(ll x,ll y){
    while (x>y) y += n;
    return y-x;
}
void work(){
    read(n);
    ll x = 1, y = (n+1)/2 + 1;
    while (qry(x,y)==n/2) x++, y++;
    x = (x-1)%n+1, y = (y-1)%n+1;
    if (ans==1){ print(x,y); return ; }
    ll k = ans;
    if (qry(x+1,y)==k && qry(x,y-1)==k) swap(x,y);
    ll l = x, r = y, mid, p = l; while (l>r) r += n;
    while (l<=r){
        mid = (l+r)>>1;
        if (qry(mid,y)==k-To(x,mid)) l = mid+1, p = mid;
        else r = mid-1;
    }
    l = p, r = y - (qry(l,y)-1);
    print(l,r); return ;
}
int main(){
//	freopen(".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