import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


struct BigRat {
  BigInt p, q;
  this(T)(T p, T q = 1) { this.p = p; this.q = q; reduce(); }
  this(BigRat r) { this.p = r.p, this.q = r.q; reduce(); }
  void reduce() {
    if (q < 0) { p = -p; q = -q; }
    const g = gcd(abs(p), q);
    p /= g;
    q /= g;
  }
  BigRat inv() const { return BigRat(q, p); }
  BigRat opBinary(string op)(BigRat a) const {
    static if (op == "+") return BigRat(p * a.q + a.p * q, q * a.q);
    else static if (op == "-") return BigRat(p * a.q - a.p * q, q * a.q);
    else static if (op == "*") return BigRat(p * a.p, q * a.q);
    else static if (op == "/") return BigRat(p * a.q, q * a.p);
    else static assert(false);
  }
  ref BigRat opOpAssign(string op)(BigRat a) {
    return mixin("this = this " ~ op ~ " a");
  }
  bool opEquals(BigRat a) const { return (p * a.q == a.p * q); }
  BigInt opCmp(BigRat a) const { return p * a.q - a.p * q; }
  string toString() const { return p.to!string ~ "/" ~ q.to!string; }
}
enum ZERO = BigRat(0, 1);
enum ONE = BigRat(1, 1);


BigRat ask(long p, long q) {
  writefln("! %s %s", p, q);
  stdout.flush;
  const BigInt r = readToken;
  const BigInt s = readToken;
  return BigRat(r, s);
}

void main() {
  const numCases = readInt;
  foreach (caseId; 0 .. numCases) {
    const N = readInt;
    auto X = new long[N];
    auto Y = new long[N];
    foreach (u; 0 .. N) {
      X[u] = readLong;
      Y[u] = readLong;
    }
    
    const xs = X.dup.sort.uniq.array;
    const xsLen = cast(int)(xs.length);
    BigRat ans = ZERO;
    if (xsLen == N) {
      auto ys = new BigRat[xsLen];
      ys[0] = ys[xsLen - 1] = ZERO;
      foreach (i; 1 .. xsLen - 1) {
        ys[i] = ask(xs[i], 1);
      }
      foreach (i; 0 .. xsLen - 1) {
        ans += BigRat(xs[i + 1] - xs[i]) * (ys[i] + ys[i + 1]) / BigRat(2);
      }
    } else {
      foreach (i; 0 .. xsLen - 1) {
        const y = ask(xs[i] + xs[i + 1], 2);
        ans += BigRat(xs[i + 1] - xs[i]) * y;
      }
    }
    
    writefln("! %s %s", ans.p, ans.q);
    stdout.flush;
  }
}