#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())

using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;

template <typename T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T, typename U> T ceil(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U> T floor(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T> int popcnt(T x) {
    return __builtin_popcountll(x);
}
template <typename T> int topbit(T x) {
    return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <typename T> int lowbit(T x) {
    return (x == 0 ? -1 : __builtin_ctzll(x));
}

template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << "P(" << p.first << ", " << p.second << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    os << "{";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")";
        itr++;
        if (itr != map_var.end())
            os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {
    os << "{";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr;
        ++itr;
        if (itr != set_var.end())
            os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
#ifdef LOCAL
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define show(...) true
#endif
template <typename T> void _show(int i, T name) {
    cerr << '\n';
}
template <typename T1, typename T2, typename... T3>
void _show(int i, const T1 &a, const T2 &b, const T3 &...c) {
    for (; a[i] != ',' && a[i] != '\0'; i++)
        cerr << a[i];
    cerr << ":" << b << " ";
    _show(i + 1, a, c...);
}

/**
 * @brief template
 */

struct Frac {
    ll P, Q;
    Frac(ll p, ll q) {
        ll G = gcd(p,q);
        P = p/G;
        Q = q/G;
    }
    Frac(ll X) {
        P = X, Q = 1;
    }
    Frac() : P(0), Q(1) {};
};

    Frac Add(Frac A, Frac B) {
        return Frac(A.P*B.Q + B.P*A.Q, A.Q*B.Q);
    }
    Frac Sub(Frac A, Frac B) {
        return Frac(A.P*B.Q - B.P*A.Q, A.Q*B.Q);
    }
    Frac Mul(Frac A, Frac B) {
        return Frac(A.P*B.P, A.Q*B.Q);
    }

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
int _;
cin >> _;
while(_--) {
    int N;
    cin >> N;
    vector<pair<ll,ll>> P(N);
    rep(i,0,N) cin >> P[i].first >> P[i].second;
    sort(ALL(P));
    vector<ll> X(N), Y(N);
    rep(i,0,N) X[i] = P[i].first, Y[i] = P[i].second;
    auto Query = [](ll p, ll q) -> pair<ll,ll> {
        ll g = gcd(p,q);
        p /= g, q /= g;
        cout << '?' << ' ' << p << ' ' << q << endl;
        ll r, s;
        cin >> r >> s;
        return {r,s};
    };
    auto Answer = [](ll p, ll q) -> void {
        ll g = gcd(p,q);
        p /= g, q /= g;
        cout << '!' << ' ' << p << ' ' << q << endl;
    };
    Frac ANS(0,1);
    Frac Cur(0,1);
    rep(i,0,N-2) {
        auto [R,S] = Query(X[i]+X[i+1],2);
        ANS = Add(ANS, Mul(Frac(R,S),Frac(X[i+1]-X[i])));
        Cur = Sub(Frac(R*2,S),Cur);
    }
    Frac Plus = Mul(Cur, Frac(X[N-1]-X[N-2],2));
    ANS = Add(ANS, Plus);
    Answer(ANS.P,ANS.Q);
}
}