#include <bits/stdc++.h>
int T, n, cnt[1005];
double query(int p, int eps = 0)
{
    std::cout << "? " << p * 1000 + eps << " 1000" << std::endl;
    long long a, b;
    std::cin >> a >> b;
    return 1.0l * a / b;
}
double k(double x1, double y1, double x2, double y2, double x)
{
    return (x - x1) / (x2 - x1) * y2 + (x - x2) / (x1 - x2) * y1;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> T;
    while (T--)
    {
        std::cin >> n;
        std::fill(cnt, cnt + 1001, 0);
        for (int i = 1, x, y; i <= n; ++i)
            std::cin >> x >> y, ++cnt[x];
        double sum = 0, lst = 0, lpos = -1, cur = 0;
        int pos = 0;
        for (int i = 0; i <= 1000; ++i)
        {
            switch (cnt[i])
            {
            case 0:
                break;
            case 1:
                cur = pos++ == 0 || pos == n ? 0 : query(i);
                sum += k(lpos, lst, i, cur, (std::round(i) + std::round(lpos)) / 2) * (std::round(i) - std::round(lpos));
                lst = cur;
                lpos = i;
                break;
            default:
                cur = pos == 0 ? 0 : query(i, -1);
                sum += k(lpos, lst, i - 0.001, cur, (std::round(i) + std::round(lpos)) / 2) * (std::round(i) - std::round(lpos));
                cur = (pos += cnt[i]) == n ? 0 : query(i, +1);
                lst = cur;
                lpos = i + 0.001;
                break;
            }
        }
        long long ans = static_cast<long long>(std::round(sum * 2));
        std::cout << "! " << (ans % 2 ? ans : ans / 2) << ' ' << (ans % 2 ? 2 : 1) << std::endl;
    }
    return 0;
}