#include<bits/stdc++.h>
using namespace std;

#define int long long

typedef pair<int, int> pii;
typedef long long LL;
typedef unsigned long long uLL;
typedef __int128_t i128;

const int inf32 = 1e9;
const LL inf64 = 1e18;

i128 gcd(i128 a, i128 b) {
    return !b ? a : gcd(b, a % b);
}

pii query(int p, int q) {
    cout << "? " << p << ' ' << q << endl;
    cin >> p >> q;
    return make_pair(p, q);
}

void answer(int p, int q) {
    cout << "! " << p << ' ' << q << endl;
}

pii operator + (pii a, pii b) {
    auto &[x, y] = a;
    auto &[p, q] = b;
    // x / y + p / q;
    x = x * q + y * p;
    y = y * q;
    if (x && y) {
        int g = gcd(x, y);
        x /= g, y /= g;
    }
    return a;
}

pii operator - (pii a, pii b) {
    auto &[x, y] = a;
    auto &[p, q] = b;
    // x / y + p / q;
    x = x * q - y * p;
    y = y * q;
    if (x && y) {
        int g = gcd(x, y);
        x /= g, y /= g;
    }
    return a;
}

pii operator * (pii a, pii b) {
    auto &[x, y] = a;
    auto &[p, q] = b;
    // x / y + p / q;
    x = x * p;
    y = y * q;
    if (x && y) {
        int g = gcd(x, y);
        x /= g, y /= g;
    }
    return a;
}

pii operator / (pii a, pii b) {
    swap(b.first, b.second);
    return a * b;
}


signed main()
{
    // freopen("G.in","r",stdin);

    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(0);

    int T = 1;
    cin >> T;
    while (T--) {
        int n;
        cin >> n;
        vector<pii> a(n + 5);
        map<int, int> mp;
        for (int i = 1; i <= n; i++) {
            cin >> a[i].first >> a[i].second;
            ++mp[a[i].first];
        }

        sort(a.begin() + 1, a.begin() + 1 + n);


        int lst_pos = -10000;
        pii lst_len = {0, 1}, ans = {0, 1};
        if (a[1].first == a[2].first && a[n].first == a[n - 1].first) {
            lst_pos = a[1].first;
            lst_len = query(a[1].first, 1);
        } else if (a[1].first == a[2].first && a[n].first != a[n - 1].first) {
            for (int i = 1; i <= n / 2; i++)
                swap(a[i], a[n - i + 1]);
            lst_len = {0, 1};
            lst_pos = a[1].first;
        } else {
            lst_len = {0, 1};
            lst_pos = a[1].first;
        }

        // for (int i = 1; i <= n; i++) cerr << a[i].first << ' ' << a[i].second << endl;
        for (int i = 1; i <= n; i++) {
            if (a[i].first == lst_pos) continue;
            // cerr << i << endl;

            if (mp[a[i].first] == 1) {
                pii new_len = i == n ? (pii){0, 1} : query(a[i].first, 1);
                int len = abs(lst_pos - a[i].first);
                ans = ans + ((new_len - lst_len) * (pii){len, 1} / (pii){2, 1});
                auto tmp = (new_len - lst_len) * (pii){len, 1} / (pii){2, 1};
                ans = ans + lst_len * (pii){len, 1};
                lst_len = new_len;
                lst_pos = a[i].first;
            } else {
                pii new_len = query(a[i].first * 1000 - 1, 1000);
                new_len = {new_len.first / new_len.second + 1, 1};
                int len = abs(lst_pos - a[i].first);
                
                ans = ans + ((new_len - lst_len) * (pii){len, 1} / (pii){2, 1});
                auto tmp = (new_len - lst_len) * (pii){len, 1} / (pii){2, 1};
                ans = ans + lst_len * (pii){len, 1};
                if (a[i].first != a[n].first) {
                    new_len = query(a[i].first * 1000 + 1, 1000);
                    new_len = {new_len.first / new_len.second + 1, 1};
                }

                lst_len = new_len;
                lst_pos = a[i].first;
            }
            
        }

        answer(ans.first, ans.second);
    }

    return 0;
}