import sys

def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

class Frac:
    def __init__(self, n, d=1):
        self.n = n
        self.d = d
        g = gcd(n, d)
        self.n //= g
        self.d //= g

    def __add__(self, other):
        return Frac(self.n * other.d + other.n * self.d, self.d * other.d)
    
    def __sub__(self, other):
        return Frac(self.n * other.d - other.n * self.d, self.d * other.d)
    
    def __mul__(self, other):
        return Frac(self.n * other.n, self.d * other.d)
    
    def __lt__(self, other):
        return self.n * other.d < other.n * self.d

def ask(x: Frac):
    print('?', x.n, x.d)
    sys.stdout.flush()
    p, q = map(int, input().split())
    return Frac(p, q)

def solve():
    n = int(input())

    pts = []
    for i in range(n):
        x, y = map(int, input().split())
        pts.append((Frac(x), Frac(y)))

    pts = list(sorted(pts))
    answers = [Frac(0) for _ in range(n)]
    for i in range(1, n - 1):
        answers[i] = ask(pts[i][0])
    S = Frac(0)
    for i in range(0, n - 1):
        S += (pts[i + 1][0] - pts[i][0]) * (answers[i] + answers[i + 1])
    S *= Frac(1, 2)
    print('!', S.n, S.d)
    sys.stdout.flush()


if __name__ == "__main__":
    t = int(input())
    for _ in range(t):
        solve()