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

int T, N;
map<ld,int> mp;
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
{
    ld x, y;
    bool operator < (const point &a)const{
        return x<a.x;
    }
}p[MX];
void ask(int u, int d)
{
    cout << "? " << u << " " << d << '\n';
    cout.flush();
}
int gcd(int a, int b){return b==0?a:gcd(b,a%b);}
void print(ld x)
{
    ll d=1;
    while(x!=round(x)) x*=10, d*=10;
    // cout << "x=" << x << ", d=" << d << '\n';
    cout << "! " << x/gcd(ll(x),d) << " " << d/gcd(ll(x),d) << '\n';
    cout.flush();
}
signed main()
{
    // freopen("testdata.in","r",stdin);
    T=read();
    while(T--)
    {
        N=read();
        mp.clear();
        for(int i=1;i<=N;i++)
        {
            scanf("%Lf%Lf",&p[i].x,&p[i].y);
            mp[p[i].x]=1;
        }
        sort(p+1,p+1+N);
        ld ans=0, pre=0;
        if(mp.size()==N) //ask point
        {   
            for(int i=2;i<=N-1;i++)
            {
                ld h=(p[i].x-p[i-1].x)/2;
                ask(p[i].x,1);
                ld u, d;
                scanf("%Lf%Lf",&u,&d);
                u/=d;
                ans=ans+(pre+u)*h;
                pre=u;
            }
            ld hn=(p[N].x-p[N-1].x)/2;
            ans=ans+pre*hn;
        }
        else //ask median
        {
            for(int i=2;i<=N;i++)
            {
                if(p[i].x==p[i-1].x) continue;
                ask(p[i].x+p[i-1].x,2);
                ld u, d;
                scanf("%Lf%Lf",&u,&d);
                u/=d;               
                ans=ans+u*(p[i].x-p[i-1].x);
            }
        }
        print(ans);
    }
    return (0-0);
}