/*
 
_/      _/    _/      _/    _/      _/   _/_/_/_/_/     _/_/       _/      _/ 
 _/    _/     _/      _/     _/    _/        _/       _/    _/     _/      _/            
  _/  _/      _/      _/      _/  _/         _/      _/      _/    _/_/  _/_/         
   _/_/       _/_/_/_/_/        _/           _/      _/      _/    _/  _/  _/          
  _/  _/      _/      _/        _/           _/      _/      _/    _/      _/          
 _/    _/     _/      _/        _/           _/       _/    _/     _/      _/          
_/      _/    _/      _/        _/           _/         _/_/       _/      _/       
 
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using i64 = long long;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define multi int _;cin>>_;while(_--)
#define int long long
#define pb push_back
#define eb emplace_back
ll gcd(ll a,ll b){ return b?gcd(b,a%b):a;}
mt19937_64 mrand(chrono::steady_clock().now().time_since_epoch().count());
int rnd(int l,int r){ return mrand() % (r - l + 1) + l;}
#ifdef localfreopen
#define debug(x) cerr << #x << " = " << (x) << endl;
void test() {cerr << "\n";}
template<typename T, typename... Args> 
void test(T x, Args... args) {cerr << x << " ";test(args...);}
#else
#define debug //
#define test //
#endif
const ll MOD = 998244353;
// const ll MOD = 1e9+7;
ll ksm(ll x,ll y){ll ans=1;x%=MOD;while(y){if(y&1)ans=ans*x%MOD;x=x*x%MOD,y/=2;}return ans;}

const int P1 = 972152273, base1 = 809;
const int P2 = 905563261, base2 = 919;
const ll N = 200005;
//head



void solve() {
    int n;
    std::cin >> n;
    std::vector<int> q;
    std::map<int, int> cnt;
    for (int i = 1; i <= n; i++) {
        int x, y;
        std::cin >> x >> y;
        q.push_back(x);
        cnt[x]++;
    }

    std::sort(q.begin(), q.end());
    q.erase(std::unique(q.begin(), q.end()), q.end());

    long double ans = 0;
    std::map<int, long double> left, right, mid;
    if (cnt[q[0]] == 1) mid[q[0]] = 0;
    else {
        int x = q[0];
        std::cout << "? " << x << " 1" << std::endl;
        long double a, b;
        std::cin >> a >> b;
        a = a / b;
        mid[x] = a;
    }
    if (cnt[q.back()] == 1) mid[q.back()] = 0;
    else {
        int x = q.back();
        std::cout << "? " << x << " 1" << std::endl;
        long double a, b;
        std::cin >> a >> b;
        a = a / b;
        mid[x] = a;
    }
    for (int i = 1; i < q.size() - 1; i++) {
        int x = q[i];
        if (cnt[x] == 1) {
            std::cout << "? " << x << " 1" << std::endl;
            long double a, b;
            std::cin >> a >> b;
            a = a / b;
            mid[x] = a;
        } else {
            long double a, b;
            std::cout << "? " << x * 4 - 1 << " 4" << std::endl;
            std::cin >> a >> b;
            a = a / b;
            left[x] = a;
            std::cout << "? " << x * 4 + 1 << " 4" << std::endl;
            std::cin >> a >> b;
            a = a / b;
            right[x] = a;
        }
    }



    for (int i = 1; i < q.size(); i++) {
        int lx = q[i - 1], rx = q[i];
        if (mid.count(lx) && mid.count(rx)) {
            long double len1 = mid[lx], len2 = mid[rx];
            ans += (len1 + len2) * (rx - lx);
            // test("MM", len1, len2, lx, rx);
        } else if (right.count(lx) && mid.count(rx)) {
            long double len1 = right[lx], len2 = mid[rx];
            long double dx = (len2 - len1) / (rx - lx - 0.25);
            len1 -= dx / 4;
            ans += (len1 + len2) * (rx - lx);
            // test("RM", len1, len2, lx, rx);
        } else if (mid.count(lx) && left.count(rx)) {
            long double len1 = mid[lx], len2 = left[rx];
            long double dx = (len2 - len1) / (rx - lx - 0.25);
            len2 += dx / 4;
            ans += (len1 + len2) * (rx - lx);
            // test("ML", len1, len2, lx, rx);
        } else if (right.count(lx) && left.count(rx)) {
            long double len1 = right[lx], len2 = left[rx];
            ans += (len1 + len2) * (rx - lx);
            // test("RL", len1, len2, lx, rx);
        }
        // test(lx, rx);
        debug(ans);
    }


    int res = (int)(ans + 0.0001);

    if (res % 2 == 0) {
        std::cout << "! " << res / 2 << " 1" << std::endl;
    } else {
        std::cout << "! " << res << " 2" << std::endl;
    }

}

signed main()
{  
#ifdef localfreopen
    // freopen("1.in","r",stdin);
#endif
    fastio
    std::cout << std::fixed << std::setprecision(10);
    int t;
    std::cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}