#include <bits/stdc++.h>
using namespace std;
typedef __int128 ll;
constexpr int max_n=1000000;
typedef pair<int,int> pii;
pii p[max_n+1];
struct frc{
	ll a,b;
	void read(){
		long long x,y;
		scanf("%lld%lld",&x,&y);
		a=x,b=y;
	}
	void writeln(){
		printf("%lld %lld\n",(long long)(a),(long long)(b));
	}
	void simpl(){
		ll g=__gcd(a,b);
		a/=g,b/=g;
	}
	friend frc operator +(const frc&x,const frc&y){
		ll g=__gcd(x.b,y.b);
		frc res;
		res.b=x.b/g*y.b;
		res.a=x.a*(y.b/g)+y.a*(x.b/g);
		res.simpl();
		return res;
	}
	friend frc operator -(const frc&x,const frc&y){
//		fprintf(stderr,"^^ - %lld %lld  %lld %lld\n",x.a,x.b,y.a,y.b);
		ll g=__gcd(x.b,y.b);
//		fprintf(stderr,"%lld,\n",g);
		frc res;
		res.b=x.b/g*y.b;
		res.a=x.a*(y.b/g)-y.a*(x.b/g);
		res.simpl();
//		fprintf(stderr,"^^ - done\n");
		return res;
	}
	friend frc operator /(frc x,const ll y){
//		fprintf(stderr,"^^ / %lld\n",y);
		ll g=__gcd(x.a,y);
		x.a/=g,x.b*=y/g;
		return x;
	}
	friend frc operator *(frc x,const ll y){
		if(y==0){
			x.b=1,x.a=0;
			return x;
		}
		ll g=__gcd(x.b,y);
		x.b/=g,x.a*=y/g;
		return x;
	}
};
frc a[max_n+1];
bool err[max_n+1];
void test(){
	int n;
	scanf("%d",&n);
	for(int i=1; i<=n; ++i)
		scanf("%d%d",&p[i].first,&p[i].second);
	sort(p+1,p+n+1);
	for(int i=2; i<n; ++i)
		if(p[i].first==p[i-1].first)
			if(p[i].first<1000)
				printf("? %d 3\n",p[i].first*3+1),err[i]=0;
			else
				err[i]=1;
		else
			if(p[i].first==p[i+1].first)
				if(p[i].first>0)
					printf("? %d 3\n",p[i].first*3-1),err[i]=0;
				else
					err[i]=1;
			else
				printf("? %d 1\n",p[i].first),err[i]=0;
	fflush(stdout);
	err[1]=err[n]=1;
	for(int i=1; i<=n; ++i)
		if(err[i])
			a[i].a=0,a[i].b=1;
		else
			a[i].read();
	for(int i=2; i<n; ++i)
		if(p[i].first==p[i-1].first){
//			fprintf(stderr,"x %d\n",i);
			if(p[i].first==p[i+1].first)
				continue;
			if(i+1<n&&p[i+1].first==p[i+2].first)
				a[i]=a[i]-(a[i+1]-a[i])/((p[i+1].first-p[i].first)*3-2);
			else
				a[i]=a[i]-(a[i+1]-a[i])/((p[i+1].first-p[i].first)*3-1);
		}
		else
			if(p[i].first==p[i+1].first)
//			fprintf(stderr,"u %d\n",i),
				a[i]=a[i]+(a[i]-a[i-1])/((p[i].first-p[i-1].first)*3-1);
//	for(int i=2; i<n; ++i)
//		fprintf(stderr,"%lld %lld\n",a[i].a,a[i].b);
	frc ans;
	ans.a=0,ans.b=1;
	for(int i=1; i<n; ++i)
		ans=ans+(a[i]+a[i+1])*(p[i+1].first-p[i].first)/2;
	printf("! ");
	ans.writeln();
	fflush(stdout);
}
int main(){
	int t;
	scanf("%d",&t);
	for(; t; test(),--t);
	return 0;
}