#include "bits/stdc++.h"


#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

// [l, r)
template<typename T, typename F>
T FindFirstTrue(T l, T r, const F &predicat) {
    --l;
    while (r - l > 1) {
        T mid = l + (r - l) / 2;
        if (predicat(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    return r;
}


template<typename T, typename F>
T FindLastFalse(T l, T r, const F &predicat) {
    return FindFirstTrue(l, r, predicat) - 1;
}

const int INFi = 2e9;
const ll INF = 2e18;

template<class T>
class Frac {
public:
    T num;
    T den;
    Frac(T num, T den) : num(num), den(den) {
        if (den < 0) {
            den = -den;
            num = -num;
        }
        normalize();
    }
    Frac() : Frac(0, 1) {}
    Frac(T num) : Frac(num, 1) {}
    double toDouble() const {
        return 1.0 * num / den;
    }
    void normalize() {
        assert(den > 0);
        ll g = abs(gcd(num, den));
        num /= g;
        den /= g;
    }

    Frac &operator+=(const Frac &rhs) {
        num = num * rhs.den + rhs.num * den;
        den *= rhs.den;
        return *this;
    }
    Frac &operator-=(const Frac &rhs) {
        num = num * rhs.den - rhs.num * den;
        den *= rhs.den;
        return *this;
    }
    Frac &operator*=(const Frac &rhs) {
        num *= rhs.num;
        den *= rhs.den;
        return *this;
    }
    Frac &operator/=(const Frac &rhs) {
        num *= rhs.den;
        den *= rhs.num;
        if (den < 0) {
            num = -num;
            den = -den;
        }
        return *this;
    }
    friend Frac operator+(Frac lhs, const Frac &rhs) {
        return lhs += rhs;
    }
    friend Frac operator-(Frac lhs, const Frac &rhs) {
        return lhs -= rhs;
    }
    friend Frac operator*(Frac lhs, const Frac &rhs) {
        return lhs *= rhs;
    }
    friend Frac operator/(Frac lhs, const Frac &rhs) {
        return lhs /= rhs;
    }
    friend Frac operator-(const Frac &a) {
        return Frac(-a.num, a.den);
    }
    friend bool operator==(const Frac &lhs, const Frac &rhs) {
        return lhs.num * rhs.den == rhs.num * lhs.den;
    }
    friend bool operator!=(const Frac &lhs, const Frac &rhs) {
        return lhs.num * rhs.den != rhs.num * lhs.den;
    }
    friend bool operator<(const Frac &lhs, const Frac &rhs) {
        return lhs.num * rhs.den < rhs.num * lhs.den;
    }
    friend bool operator>(const Frac &lhs, const Frac &rhs) {
        return lhs.num * rhs.den > rhs.num * lhs.den;
    }
    friend bool operator<=(const Frac &lhs, const Frac &rhs) {
        return lhs.num * rhs.den <= rhs.num * lhs.den;
    }
    friend bool operator>=(const Frac &lhs, const Frac &rhs) {
        return lhs.num * rhs.den >= rhs.num * lhs.den;
    }
};

using Fraction = Frac<ll>;

Fraction ask(ll p, ll q) {
    cout << "? " << p << " " << q << endl;
    ll r, s; cin >> r >> s;
    return {r, s};
}

void solve() {
    map<int, int> cnt;
    int n; cin >> n;
    rep(_, n) {
        int x, y; cin >> x >> y;
        cnt[x]++;
    }

    vector<pair<ll, ll>> a(all(cnt));
    if (a.size() <= 1) {
        cout << "! 0 1" << endl;
        return;
    }

    Fraction result(0, 1);

    auto Add = [&] (Fraction len1, Fraction len2, Fraction xdiff, Fraction ladd, Fraction radd) {
        xdiff.normalize();
        assert(xdiff.num != 0);
        Fraction L = len1;
        if (ladd.num != 0) {
            auto df = len1 - len2;
            df.normalize();
            df /= xdiff;
            df.normalize();
            df *= (xdiff + ladd);
            df.normalize();
            L = df + len2;
            L.normalize();
        }
        Fraction R = len2;
        if (radd.num != 0) {
            auto df = len2 - len1;
            df.normalize();
            df /= xdiff;
            df.normalize();
            df *= (xdiff + radd);
            df.normalize();
            R = df + len1;
            R.normalize();
        }
        auto h = xdiff + ladd + radd;
        h /= 2;
        h.normalize();
        auto res = (L + R) * h;
        res.normalize();
        result += res;
        result.normalize();
    };


    Fraction len1, ladd, prv;
    if (a[0].second == 1) {
        len1 = {0, 1};
        ladd = {0, 1};
        prv = {a[0].first, 1};
    } else {
        len1 = ask(a[0].first, 1);
        ladd = {0, 1};
        prv = {a[0].first, 1};
    }

    for(int i = 1; i + 1 < (int)a.size(); ++i) {
        if (a[i].second == 1) {
            Fraction nx = {a[i].first, 1};
            Fraction cur = ask(a[i].first, 1);

            Add(len1, cur, nx - prv, ladd, 0);

            prv = nx;
            ladd = {0, 1};
            len1 = cur;
            continue;
        }
        Fraction radd = {1, 4};
        Fraction nx = {a[i].first, 1};
        Fraction rp = nx - radd;
        rp.normalize();

        Fraction len2 = ask(rp.num, rp.den);

        Fraction xdiff = rp - prv;
        Add(len1, len2, xdiff, ladd, radd);

        prv = nx + radd;
        ladd = radd;
        ladd.normalize();
        prv.normalize();
        len1 = ask(prv.num, prv.den);
    }
    {
        Fraction radd = {0, 1};
        Fraction nx = {a.back().first, 1};
        Fraction len2 = {0, 1};
        if (a.back().second > 1) {
            len2 = ask(nx.num, nx.den);
        }

        Add(len1, len2, nx - prv, ladd, radd);
    }
    cout << "! " << result.num << ' ' << result.den << endl;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(12) << fixed;
    int t = 1;
    cin >> t;

    rep(i, t) {
        solve();
    }
    return 0;
}