#include<bits/stdc++.h>
#define ll long long
#define lll __int128
#define lf double
using namespace std;
ll Read()
{
    ll Output=0;
    char Input=getchar();
    while(Input<'0'||Input>'9')
    Input=getchar();
    while(Input>='0'&&Input<='9')
    {
        Output=Output*10+Input-'0';
        Input=getchar();
    }
    return Output;
}
void Write(lll X)
{
    if(X<0)putchar('-'),X=-X;
    if(X>9)
    Write(X/10);
    putchar('0'+X%10);
}
lll GCD(lll X,lll Y)
{
    return (Y?GCD(Y,X%Y):X);
}
struct frac
{
    lll X,Y;
    frac(lll A,lll B):X(A),Y(B)
    {
        if(A<0)
        {
            X=-X,Y=-Y;
        }
    }
    frac():frac(0,1){}
    frac(lll A):frac{A,1}{}
    explicit operator double() const
    {
        return 1.*X/Y;
    }
    void Out()
    {
        Write(X);
        putchar(' ');
        Write(Y);
    }
    void Simp()
    {
        lll Gcd=GCD(X,Y);
        X/=Gcd,Y/=Gcd;
    }
    frac operator -()const
    {
        return frac(X,-Y);
    }
    frac &operator += (const frac &Rhs)
    {
        X=X*Rhs.Y+Rhs.X*Y;
        Y*=Rhs.Y;
        Simp();
        return *this;
    }
    frac &operator -= (const frac &Rhs)
    {
        X=X*Rhs.Y+Rhs.X*Y;
        Y*=Rhs.Y;
        Simp();
        return *this;
    }
    frac &operator *= (const frac &Rhs)
    {
        X*=Rhs.X;
        Y*=Rhs.Y;
        Simp();
        return *this;
    }
    frac &operator /= (const frac &Rhs)
    {
        X*=Rhs.Y;
        Y*=Rhs.X;
        Simp();
        return *this;
    }
    friend frac operator + (const frac Lhs,const frac &Rhs)
    {
        frac Res=Lhs;
        Res+=Rhs;
        return Res;
    }
    friend frac operator - (const frac Lhs,const frac &Rhs)
    {
        frac Res=Lhs;
        Res-=Rhs;
        return Res;
    }
    friend frac operator * (const frac Lhs,const frac &Rhs)
    {
        frac Res=Lhs;
        Res*=Rhs;
        return Res;
    }
    friend frac operator / (const frac Lhs,const frac &Rhs)
    {
        frac Res=Lhs;
        Res/=Rhs;
        return Res;
    }
};
int T;
int N;
struct point
{
    int X,Y;
}Point[1001];
int Copy[1001];
bool Cmp(point A,point B)
{
    return A.X<B.X;
}
void Oper(frac X)
{
    printf("? ");
    X.Out();
    putchar('\n');
    fflush(stdout);
}
void Solve()
{
    N=Read();
    for(int i=1;i<=N;++i)
    Point[i].X=Read(),Point[i].Y=Read(),Copy[i]=Point[i].X;
    sort(Point+1,Point+N+1,Cmp);
    sort(Copy+1,Copy+N+1);
    int Len=unique(Copy+1,Copy+N+1)-Copy-1;
    frac Ans=frac();
    frac ToEnd=frac();
    for(int i=1;i<Len-(Len==N);++i)
    {
        Oper((frac(Copy[i])+frac(Copy[i+1]))/frac(2));
        int X=Read(),Y=Read();
        Ans+=frac(X,Y)*frac(Copy[i+1]-Copy[i]);
        if(Len==N)
        ToEnd=frac(X,Y)*frac(2)-ToEnd;
    }
    if(Len==N)
    Ans+=ToEnd*(frac(Copy[N]-Copy[N-1],2));
    printf("! ");
    Ans.Out();
    putchar('\n');
    fflush(stdout);
}
int main()
{
    T=Read();
    while(T--)
    {
        Solve();
    }
}