#include <cstdio>
#include <cmath>
#define read() ({int x,c,f=1;while((c=getchar())<48||57<c)if(c=='-')f=-1;for(x=c^48;47<(c=getchar())&&c<58;)x=x*10+(c^48);x*f; })

using ll = long long;
typedef struct vec
{
    double x, y;
    double operator*(const vec &rhs) const { return x * rhs.x + y * rhs.y; }
    vec operator+(const vec &rhs) const { return {x + rhs.x, y + rhs.y}; }
    vec operator-(const vec &rhs) const { return {x - rhs.x, y - rhs.y}; }
    vec operator*(double p) const { return {x * p, y * p}; }
    vec operator/(double p) const { return {x / p, y / p}; }
} point;
double len(const vec &v) { return sqrt(v * v); }
double dis(point a, point b) { return len(a - b); }
point p[1003];

void solve()
{
    int n = read();
    point ans = {0, 0}, las = {1e18, 1e18};
    for (int i = 1; i <= n; ++i)
        p[i] = vec{(double)read(), (double)read()}, ans = ans + p[i];
    ans = ans / n;
    double exp_dis = 0;
    for (int i = 1; i <= n; ++i)
        exp_dis += dis(ans, p[i]);
    while (dis(ans, las) / exp_dis > 3e-7)
    {
        double f = 0;
        for (int i = 1; i <= n; ++i)
            f += 1 / dis(p[i], ans);
        point t = {0, 0};
        for (int i = 1; i <= n; ++i)
            t = t + p[i] / dis(p[i], ans);
        las = ans, ans = t / f;
    }
    printf("%.9lf %.9lf\n", ans.x, ans.y);
}
int main()
{
    for (int t = read(); t--;)
        solve();
}
/*
1
3
-3 0
0 3
3 0
*/