#include<iostream>
#include<cstdio>
#include<algorithm>
#define int long long
using namespace std;
typedef long long ll;
const int MX=1010;

int T, N;
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
struct point
{
    int x, y;
    bool operator < (const point &a)const{
        return x<a.x;
    }
}p[MX];
int gcd(int a, int b){return b==0?a:gcd(b,a%b);}
int lcm(int a, int b){return a/gcd(a,b)*b;}
struct frac
{
    int u, d;
    frac(int uu, int dd)
    {
        int g=gcd(uu,dd);
        u=uu/g; d=dd/g;
    }
    frac operator + (const frac &a)const{
        int D=lcm(d,a.d);
        int U=D/d*u+D/a.d*a.u;
        // cout << "U=" << U << ", D=" << D << '\n';
        return frac{U,D};
    }
    frac operator * (const int &a)const{
        int g=gcd(d,a);
        return frac{u/g*a,d/g};
    }
    frac operator * (const frac &a)const{
        int g1=gcd(u,a.d);
        int g2=gcd(d,a.u);
        // cout << "u=" << u << ", d=" << d << '\n';
        // cout << "a.u=" << a.u << ", a.d=" << a.d << '\n';
        // cout << "g1=" << g1 << ", g2=" << g2 << '\n';
        // cout << "fu=" << u/g1/g2*a.u << ", fd=" << d/g1/g2*a.d << '\n';
        return frac{u*a.u/g1/g2,d*a.d/g1/g2};
    }
    void easy()
    {
        int g=gcd(u,d);
        u/=g; d/=g;
    }
    void print(){cout << u << "/" << d << '\n';}
};
void ask(int id)
{
    cout << "? " << p[id].x << " 1\n";
    cout.flush();
}
signed main()
{
    // freopen("testdata.in","r",stdin);
    T=read();
    while(T--)
    {
        N=read();
        for(int i=1;i<=N;i++)
        {
            p[i].x=read();
            p[i].y=read();
        }
        sort(p+1,p+1+N);
        frac ans={0,1}, pre={0,1};
        for(int i=2;i<=N-1;i++)
        {
            frac h(p[i].x-p[i-1].x,2);
            ask(i);
            int u=read(), d=read();
            frac now={u,d};
            ans=ans+(pre+now)*h;
            ans.easy();
            pre=now;
        }
        frac hn(p[N].x-p[N-1].x,2);
        ans=ans+pre*hn;
        ans.easy();
        cout << "! " << ans.u << " " << ans.d << '\n';
        cout.flush();
    }
    return (0-0);
}