#include <cstdio>

#include <iostream>

#include <algorithm>

#include <vector>

#include <cstring>

#define LL int

const LL mod=;

const LL N=;

LL dp[N];

LL bit[];

using namespace std;

struct Point

{

    double x,y;

};//约定传入点的vector包含n+1个点，最后一个点与第一个点等值(模拟闭合圈）

int n;

double Area(vector<Point> va)

{

    double rec=;

    for(int i=;i<va.size()-;i++)

        rec+=va[i].x*va[i+].y-va[i+].x*va[i].y;

    rec*=0.5;

    return rec;

}

Point GrvCenter(vector<Point> va)

{

    Point rec;

    rec.x=,rec.y=;

    double area=Area(va);//每个三角形在总面积中的权重

    for(int i=;i<va.size()-;i++)

        rec.x+=(va[i].x+va[i+].x)*(va[i].x*va[i+].y-va[i+].x*va[i].y);

    for(int i=;i<va.size()-;i++)

        rec.y+=(va[i].y+va[i+].y)*(va[i].x*va[i+].y-va[i+].x*va[i].y);

    rec.x/=area*;

    rec.y/=area*;

    return rec;

}

int main()

{

    cin.sync_with_stdio(false);

    int t;

    int n;

    scanf("%d",&t);

    while(t--)

    {

        vector<Point> va;

        scanf("%d",&n);

        for(int i=;i<n;i++)

        {

            Point x;

            scanf("%lf %lf",&x.x,&x.y);

            va.push_back(x);

        }

        va.push_back(*va.begin());

        printf("%.2f %.2f\n",GrvCenter(va).x,GrvCenter(va).y);

    }

}