#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

template <typename T, bool Reduce = false> class Rational {
    static T my_gcd(T x_, T y_) {
        unsigned long long x = x_ < 0 ? -x_ : x_, y = y_ < 0 ? -y_ : y_;
        if (!x or !y) return x + y;
        int n = __builtin_ctzll(x), m = __builtin_ctzll(y);
        x >>= n, y >>= m;
        while (x != y) {
            if (x > y)
                x = (x - y) >> __builtin_ctzll(x - y);
            else
                y = (y - x) >> __builtin_ctzll(y - x);
        }
        return x << (n > m ? m : n);
    }

    void normalize() {
        if (den < 0) num = -num, den = -den;
        if (den == 0) num = (num > 0 ? 1 : num < 0 ? -1 : 0);
        if constexpr (Reduce) {
            T g = my_gcd(num, den);
            if (g > 0) num /= g, den /= g;
        }
    }

  public:
    T num, den;

    Rational() {}
    Rational(T num) : num(num), den(T(1)) {}
    Rational(T num, T den) : num(num), den(den) { normalize(); }

    Rational operator+(const Rational& r) const { return Rational(num * r.den + den * r.num, den * r.den); }
    Rational operator-(const Rational& r) const { return Rational(num * r.den - den * r.num, den * r.den); }
    Rational operator*(const Rational& r) const { return Rational(num * r.num, den * r.den); }
    Rational operator/(const Rational& r) const { return Rational(num * r.den, den * r.num); }
    Rational& operator+=(const Rational& r) { return *this = *this + r; }
    Rational& operator-=(const Rational& r) { return *this = *this - r; }
    Rational& operator*=(const Rational& r) { return *this = *this * r; }
    Rational& operator/=(const Rational& r) { return *this = *this / r; }

    Rational operator+(const T& val) const { return *this + Rational(val); }
    Rational operator-(const T& val) const { return *this - Rational(val); }
    Rational operator*(const T& val) const { return *this * Rational(val); }
    Rational operator/(const T& val) const { return *this / Rational(val); }
    Rational& operator+=(const T& val) { return *this = *this + val; }
    Rational& operator-=(const T& val) { return *this = *this - val; }
    Rational& operator*=(const T& val) { return *this = *this * val; }
    Rational& operator/=(const T& val) { return *this = *this / val; }
    friend Rational operator+(const T& val, const Rational& r) { return r + val; }
    friend Rational operator-(const T& val, const Rational& r) { return r - val; }
    friend Rational operator*(const T& val, const Rational& r) { return r * val; }
    friend Rational operator/(const T& val, const Rational& r) { return r / val; }

    Rational operator-() const { return Rational(-num, den); }
    Rational abs() const { return Rational(num < 0 ? -num : num, den); }

    bool operator==(const Rational& r) const {
        if (den == 0 and r.den == 0) return num == r.num;
        if (den == 0 or r.den == 0) return false;
        return num * r.den == den * r.num;
    }
    bool operator!=(const Rational& r) const { return !(*this == r); }
    bool operator<(const Rational& r) const {
        if (den == 0 and r.den == 0) return num < r.num;
        if (den == 0) return num < 0;
        if (r.den == 0) return r.num > 0;
        return num * r.den < den * r.num;
    }
    bool operator<=(const Rational& r) const { return (*this == r) or (*this < r); }
    bool operator>(const Rational& r) const { return r < *this; }
    bool operator>=(const Rational& r) const { return (*this == r) or (*this > r); }

    bool operator==(const T& val) const { return *this == Rational(val); }
    bool operator!=(const T& val) const { return *this != Rational(val); }
    bool operator<(const T& val) const { return *this < Rational(val); }
    bool operator<=(const T& val) const { return *this <= Rational(val); }
    bool operator>(const T& val) const { return *this > Rational(val); }
    bool operator>=(const T& val) const { return *this >= Rational(val); }
    friend bool operator==(const T& val, const Rational& r) { return r == val; }
    friend bool operator!=(const T& val, const Rational& r) { return r != val; }
    friend bool operator<(const T& val, const Rational& r) { return r > val; }
    friend bool operator<=(const T& val, const Rational& r) { return r >= val; }
    friend bool operator>(const T& val, const Rational& r) { return r < val; }
    friend bool operator>=(const T& val, const Rational& r) { return r <= val; }

    explicit operator double() const { return (double)num / (double)den; }
    explicit operator long double() const { return (long double)num / (long double)den; }
    friend std::ostream& operator<<(std::ostream& os, const Rational& r) { return os << r.num << '/' << r.den; }
};

using namespace std;

using ll = long long;

using R = Rational<ll, true>;

int rest;

R query(R val) {
    assert(rest-- > 0);
    cout << "? " << val.num << " " << val.den << endl;
    ll r, s;
    cin >> r >> s;
    return R(r, s);
}

void answer(R ans) { cout << "! " << ans.num << " " << ans.den << endl; }

void solve() {
    int n;
    cin >> n;
    rest = n - 2;
    vector<int> x(n), y(n);
    for (int i = 0; i < n; i++) cin >> x[i] >> y[i];

    map<int, vector<int>> mp;
    for (int i = 0; i < n; i++) mp[x[i]].emplace_back(y[i]);
    vector<pair<int, vector<int>>> xs;
    for (auto [key, val] : mp) xs.emplace_back(key, val);

    int N = xs.size();
    vector<R> ls(N, -1), rs(N, -1);
    ls[0] = rs[N - 1] = 0;
    R ans = 0;
    long double sum = 0;
    for (int i = 0; i + 1 < N; i++) {
        R lx = xs[i].first, rx = xs[i + 1].first;
        vector<pair<R, R>> line;
        {
            // determine rs[i];
            int len = xs[i].second.size();
            if (i == 0) {
                if (len == 1) {
                    line.emplace_back(lx, 0);
                } else {
                    auto qx = lx + R(1, 3);
                    line.emplace_back(qx, query(qx));
                }
            } else {
                if (len == 1) {
                    assert(ls[i] != -1);
                    line.emplace_back(lx, ls[i]);
                } else {
                    auto qx = lx + R(1, 3);
                    line.emplace_back(qx, query(qx));
                }
            }
        }
        {
            // determine ls[i + 1];
            int len = xs[i + 1].second.size();
            if (i + 1 == N - 1) {
                if (len == 1) {
                    line.emplace_back(rx, 0);
                } else {
                    auto qx = rx - R(1, 3);
                    line.emplace_back(qx, query(qx));
                }
            } else {
                if (len == 1) {
                    assert(rs[i + 1] == -1);
                    line.emplace_back(rx, query(rx));
                } else {
                    auto qx = rx - R(1, 3);
                    line.emplace_back(qx, query(qx));
                }
            }
        }
        {
            assert(line.size() == 2);
            auto d = (line[1].second - line[0].second) / (line[1].first - line[0].first);
            rs[i] = line[0].second + d * (lx - line[0].first);
            ls[i + 1] = line[0].second + d * (rx - line[0].first);
        }
        ans += (rs[i] + ls[i + 1]) * (rx - lx) / 2;
        {
            auto s = rs[i] + ls[i + 1];
            sum += (long double)(s.num * (xs[i + 1].first - xs[i].first)) / s.den;
        }
    }
    // assert(ans.den == 1 or ans.den == 2);
    ll p = roundl(sum);
    ans = (p & 1 ? R(p, 2) : R(p / 2, 1));

    answer(ans);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}