#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<queue>
#include<functional>
#include<utility>
#include<cassert>
using namespace std;
inline int read(){
    int x = 0,f = 1;
    char c = getchar();
    while(c < '0' || c > '9'){
        if(c == '-') f = -1;
        c = getchar();
    }
    while(c >= '0' && c <= '9'){
        x = (x << 3) + (x << 1) + (c ^ 48);
        c = getchar();
    }
    return x * f;
}
const int N = 1011;
struct point{
    long double x,y;
}a[N];
bool cmp(point a,point b){
    return a.x < b.x;
}
struct frac{
    long double u,v;
};
long long gcd(long long x,long long y){
    if(!y) return x;
    return gcd(y,x % y);
}
inline frac add(frac x,frac y){
    frac ret;
    ret = (frac){x.u * y.v + x.v * y.u,x.v * y.v};
    long long d = gcd((long long)ret.u,(long long )ret.v);
    if(d) ret = {ret.u / d,ret.v / d};
    return ret;
}
inline frac mul(frac x,frac y){
    frac ret;
    ret = (frac){x.u * y.u,x.v * y.v};
    long long d = gcd((long long)ret.u,(long long )ret.v);
    if(d) ret = {ret.u / d,ret.v / d};
    return ret;
}
map<long double,bool> mp;
int n;
frac ask(frac x){
    frac ret;
    printf("? %.Lf %.Lf\n",x.u,x.v);
    fflush(stdout);
    scanf("%Lf %Lf",&ret.u,&ret.v);
    return ret;
}
void ans(frac x){
    printf("! %.Lf %.Lf\n",x.u,x.v);
    fflush(stdout);
}
int main(){
    int i,j,t;
    frac half = {1,2};
    t = read();
    while(t--){
        bool flag = 0;
        n = read();
        mp.clear();
        for(i = 1;i <= n;i++){
            scanf("%Lf %Lf",&a[i].x,&a[i].y);
            if(mp[a[i].x]) flag = 1;
            mp[a[i].x] = 1;
        }
        sort(a + 1,a + n + 1,cmp);
        frac temp,p,q = {0,1.0};
        frac res = {0.0,1.0};
        if(!flag){
            for(i = 2;i < n;i++){
                temp = (frac){a[i].x,1.0}; 
                p = ask(temp);
                res = add(res,mul(add(p,q),(frac){a[i].x - a[i - 1].x,2.0}));
                q = p;
            }
            res = add(res,mul(q,(frac){a[n].x - a[n - 1].x,2.0}));
        }
        else{
            int lst = 1;
            for(i = 2;i <= n;i++){
                if(a[i].x == a[lst].x) continue;
                //printf("%Lf %Lf\n",a[i].x,a[lst].x);
                temp = (frac){a[i].x + a[lst].x,2.0}; 
                p = ask(temp);
                res = add(res,mul(p,(frac){a[i].x - a[lst].x,1.0}));
                lst = i;
            }
        }
        ans(res);
    }
    return 0;
}