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

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

db hipot(db a, db b)
{
	return sqrt(a * a + b * b);
}

int n;
vector<PII> v;
const int INF = 1'000'447;

db f(db x, db y)
{
	db ans = 0;
	for (auto [X, Y] : v)
		ans += hipot(X - x, Y - y);
	return ans;
}

db fBC(db x)
{
	db l = -INF, r = INF;
	
	const db coef = (-1 + sqrt(5)) / 2;
	const int M = 100;
	db m1 = r - coef * (r - l), fm1 = f(x, m1),
		m2 = l + coef * (r - l), fm2 = f(x, m2);
	FOR(i, 0, M)
	{
		if (fm1 < fm2)
		{
			r = m2;
			m2 = m1;
			fm2 = fm1;
			m1 = r - coef * (r - l);
			
			fm1 = f(x, m1);//
		}
		else
		{
			l = m1;
			m1 = m2;
			fm1 = fm2;
			m2 = l + coef * (r - l);
			
			fm2 = f(x, m2);//
		}
	}
	return (l + r) / 2;
}

pair<db, db> fAB()
{
	db l = -INF, r = INF;
	
	const db coef = (-1 + sqrt(5)) / 2;
	const int M = 100;
	db m1 = r - coef * (r - l), fm1 = f(m1, fBC(m1)),
		m2 = l + coef * (r - l), fm2 = f(m2, fBC(m2));
	FOR(i, 0, M)
	{
		if (fm1 < fm2)
		{
			r = m2;
			m2 = m1;
			fm2 = fm1;
			m1 = r - coef * (r - l);
			
			fm1 = f(m1, fBC(m1));//
		}
		else
		{
			l = m1;
			m1 = m2;
			fm1 = fm2;
			m2 = l + coef * (r - l);
			
			fm2 = f(m2, fBC(m2));//
		}
	}
	return MP((l + r) / 2, fBC((l + r) / 2));
	
}


void solve()
{
	cin >> n;
	v.resize(n);
	
	for (auto& [x, y] : v)
		cin >> x >> y;

	auto res = fAB();
	cout << res.F << ' ' << res.S << "\n";
}


int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	int t;
	cin >> t;
	while(t--)
	{
		solve();
	}
	
	return 0;
}