#include <bits/stdc++.h>

#define long long long int
#define DEBUG
using namespace std;

// @author: pashka

struct rat {
    __int128_t p = 0, q = 1;

    __int128_t mygcd(__int128_t a, __int128_t b) {
        if (a < 0) a = -a;
        if (b < 0) b = -b;
        while (b != 0) {
            __int128_t c = a % b;
            a = b;
            b = c;
        }
        return a;
    }

    rat(__int128_t _p, __int128_t _q) {
        __int128_t d = mygcd(_p, _q);
        p = _p / d;
        q = _q / d;
        if (q < 0) {
            p = -p;
            q = -q;
        }
    }

    rat(long x) {
        p = x;
    }

    rat() {

    }

    rat operator + (rat x) const {
        return {p * x.q + x.p * q, q * x.q};
    }

    rat operator - (rat x) const {
        return {p * x.q - x.p * q, q * x.q};
    }

    rat operator * (rat x) const {
        return {p * x.p, q * x.q};
    }

    rat operator / (rat x) const {
        return {p * x.q, q * x.p};
    }
};

string tostring(__int128_t x) {
    if (x == 0) return "0";
    string s;
    while (x > 0) {
        s += (char)('0' + x % 10);
        x /= 10;
    }
    reverse(s.begin(), s.end());
    return s;
}

struct test {

    rat ask(rat x) {
        cout << "? " << tostring(x.p) << " " << tostring(x.q) << endl;
        long p, q;
        cin >> p >> q;
        return {p, q};
    }

    rat calc(rat y1, rat y2, rat x1, rat x2, rat d) {
        rat m = d * rat(1, 2);
        rat r = y1 + ((m - x1) * (y2 - y1) / (x2 - x1));
        return r * d;
    }

    void solve() {
        int n;
        cin >> n;
        vector<int> x(n), y(n);
        for (int i = 0; i < n; i++) {
            cin >> x[i] >> y[i];
        }
        sort(x.begin(), x.end());
        vector<pair<int, int>> xx;
        for (int i = 0; i < n; i++) {
            if (xx.empty() || x[i] > xx.back().first) {
                xx.push_back({x[i], 1});
            } else {
                xx.back().second++;
            }
        }
        int m = xx.size();
        vector<rat> val(m, 0);
        vector<rat> val2(m, 0);
        for (int i = 0; i < m; i++) {
            if (xx[i].second == 1) {
                if (i > 0 && i < m - 1)
                    val[i] = ask(xx[i].first);
            } else {
                if (i > 0) {
                    val[i] = ask(rat(xx[i].first) - rat(1, 3));
                }
                if (i < m - 1) {
                    val2[i] = ask(rat(xx[i].first) + rat(1, 3));
                }
            }
        }
        rat res = 0;
        for (int i = 0; i < m - 1; i++) {
            rat x1, y1, x2, y2;
            rat d = xx[i + 1].first - xx[i].first;
            if (xx[i].second == 1) {
                x1 = 0;
                y1 = val[i];
            } else {
                x1 = {1, 3};
                y1 = val2[i];
            }
            if (xx[i + 1].second == 1) {
                x2 = d;
                y2 = val[i + 1];
            } else {
                x2 = d - rat(1, 3);
                y2 = val[i + 1];
            }
            res = res + calc(y1, y2, x1, x2, d);
        }
//        res = res * rat(1, 2);
        cout << "! " << tostring(res.p) << " " << tostring(res.q) << endl;
    }
};

int main() {
    ios::sync_with_stdio(false);

    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        test().solve();
    }

    return 0;
}