#include <bits/stdc++.h>

using namespace std;

typedef long long i64;
typedef unsigned long long u64;
typedef double lf;

const int inf = 1e9 + 100500;

pair<lf, int> getMantissaAndExponent(const string& s) {
    if (s == "0") {
        return {0, 0};
    }
    int exponent = (int) s.length();
    lf mantissa = std::stod("0." + s.substr(0, 40));
    return {mantissa, exponent};
}

lf pow10(int x) {
    if (x < 0) {
        return 1.0 / pow10(-x);
    }
    lf res = 1;
    for (int i = 0; i < x; ++i) {
        res *= 10;
    }
    return res;
}

lf ask(int x) {
    cout << "? " << x << " 1" << endl;
    string p, q;
    cin >> p >> q;
    auto [pm, pe] = getMantissaAndExponent(p);
    auto [qm, qe] = getMantissaAndExponent(q);
    int exp = pe - qe;
    return pm / qm * pow10(exp);
}

void solve() {
    int n;
    cin >> n;
    vector<int> xs(n);
    for (int i = 0; i < n; ++i) {
        int mycopka;
        cin >> xs[i] >> mycopka;
    }
    sort(xs.begin(), xs.end());
    vector<lf> answers(n, 0);
    for (int i = 1; i + 1 < n; ++i) {
        answers[i] = ask(xs[i]);
    }
    lf S = 0;
    vector<lf> sum;
    for (int i = 0; i + 1 < n; ++i) {
        sum.push_back((xs[i + 1] - xs[i]) * (answers[i + 1] + answers[i]));
    }
    // for (int i = 1; i + 1 < n; ++i) {
    //     sum.push_back((xs[i + 1] - xs[i - 1]) * answers[i]);
    // }
    sort(sum.begin(), sum.end());
    S = accumulate(sum.begin(), sum.end(), 0.0);

    i64 SS = i64(roundl(S));
    if (SS % 2 == 0) {
        cout << "! " << SS / 2 << " 1" << endl;
    } else {
        cout << "! " << SS << " 2" << endl;
    }
}

signed main() {
#ifndef ONLINE_JUDGE
    // freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
    cin >> t;
    for (int i = 0; i < t; i++) {
        solve();
    }
}