#include <stdio.h>
#include <string.h>

#include <queue>
#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)

#define fi first
#define se second
#define em emplace

using namespace std;

typedef long long LL;
constexpr int N = 1005;

LL gcd(LL x, LL y) {
	return y ? gcd(y, x % y) : x;
}

struct Frac {
	LL x, y;
	Frac simp(LL a, LL b) const {
		LL d = gcd(a, b);
		return (Frac){a / d, b / d};
	}
	Frac operator + (const Frac &t) const {
		return simp(x * t.y + y * t.x, y * t.y);
	}
	Frac operator * (int t) const {
		return simp(x * t, y);
	}
	Frac operator / (int t) const {
		return simp(x, y * t);
	}
};

Frac Q(int x) {
	printf("? %d 1\n", x);
	fflush(stdout);
	Frac ret;
	scanf("%lld%lld", &ret.x, &ret.y);
	return ret;
}

int n;
int xs[N];
Frac v[N];

int main() {
	int task;
	for (scanf("%d", &task); task--; ) {
		scanf("%d", &n);
		for (int i = 0, y; i < n; ++i) {
			scanf("%d%d", xs + i, &y);
		}
		sort(xs, xs + n);
		for (int i = 1; i < n - 1; ++i) {
			v[i] = Q(xs[i]);
		}
		Frac res;
		res = v[0] = v[n - 1] = (Frac){0ll, 1ll};
		for (int i = 1; i < n; ++i) {
			res = res + (v[i] + v[i - 1]) * (xs[i] - xs[i - 1]) / 2;
		}
		printf("! %lld %lld\n", res.x, res.y);
		fflush(stdout);
	}
	return 0;
}