#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int, int>
using namespace std;

struct num{
    int a,b;
    num(int x,int y){
        int d=__gcd(abs(x),abs(y));
        a=x/d;
        b=y/d;
    }
    num(){a=0,b=1;}
    num(int x){
        a=x;
        b=1;
    }
    num operator+(num y){
        return num(a*y.b+y.a*b,b*y.b);
    }
    num operator*(num y){
        return num(a*y.a,b*y.b);
    }
    num operator/(num y){
        return num(a*y.b,b*y.a);
    }
    num operator-(num y){
        return num(a*y.b-y.a*b,b*y.b);
    }
};
struct Point 
{
    num x,y;
    Point(){}
    Point(num a,num b){
        x=a,y=b;
    }
};
num getval(Point a1,Point a2,num x){
    auto [x1,y1]=a1;
    auto [x2,y2]=a2;
    return y1+(y2-y1)/(x2-x1)*(x-x1);
}
num query(num u){
    assert(__gcd(u.a,u.b)==1);
    assert(u.b<=1000);
    assert(u.b>0);
    cout<<"? "<<u.a<<" "<<u.b<<endl;
    int x,y;
    cin>>x>>y;
    return num(x,y);
}

num diff=num(1,5);

void solve() {
    int n;
    cin>>n;
    vector<int>vx;
    map<int,int>mp;
    for(int i=0;i<n;i++){
        int x,y;
        cin>>x>>y;
        mp[x]++;
    }
    for(auto [x,cnt]:mp){
        vx.pb(x);
    }
    n=vx.size();
    Point val[n][2];
    num ans(0);

    if(mp[vx[0]]>1){
        num now=query(num(vx[0])+diff);
        val[0][1]=Point(num(vx[0])+diff,now);
    }
    else {
        num now=num(0);
        val[0][1]=Point(num(vx[0]),now);
    }

    if(mp[vx[n-1]]>1){
        num now=query(num(vx[n-1])-diff);
        val[n-1][0]=Point(num(vx[n-1])-diff,now);
    }
    else {
        num now=num(0);
        val[n-1][0]=Point(num(vx[n-1]),now);
    }

    for(int i=1;i<n-1;i++){
        if(mp[vx[i]]==1){
            num now=query(num(vx[i]));
            val[i][0]=val[i][1]=Point(vx[i],now);
        }
        else {
            num now=query(num(vx[i])-diff);
            val[i][0]=Point(num(vx[i])-diff,now);
            now=query(num(vx[i])+diff);
            val[i][1]=Point(num(vx[i])+diff,now);
        }
    }
    for(int i=0;i<n-1;i++){
        num high=num(vx[i+1]-vx[i]);
        num len1=getval(val[i][1],val[i+1][0],vx[i]);
        num len2=getval(val[i][1],val[i+1][0],vx[i+1]);
        ans=ans+high*(len1+len2)/num(2);
    }
    int d=__gcd(ans.a,ans.b);
    cout<<"! "<<ans.a/d<<" "<<ans.b/d<<endl;
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}