#include<bits/stdc++.h>
using namespace std;
inline long double query(int x,int y){
	printf("? %d %d\n",x,y);
	fflush(stdout);
	long double a,b;
	scanf("%Lf%Lf",&a,&b);
	return  a*1.0/b;
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		int n;
		scanf("%d",&n);
		vector<int> v(n);
		for(register int i=0;i<n;++i){
			int y;scanf("%d%d",&v[i],&y);
		}
		sort(v.begin(),v.end());
		v.erase(unique(v.begin(),v.end()),v.end());
		long double ans=0.0;
		if((int)v.size()<n){
			for(register int i=0;i+1<v.size();++i)
			    ans+=1.0*(v[i+1]-v[i])*query(v[i+1]+v[i],2)*2;
		}
		else{
			for(register int i=1;i+1<v.size();++i)
			    ans+=1.0*(v[i+1]-v[i-1])*query(v[i],1)*2;
		}
		int sum=llround(ans);
		if(sum&1)printf("! %d 2\n",sum);
		else printf("! %d 1\n",sum/2);
		fflush(stdout);
	}
	return 0;
}