1 #include <bits/stdc++.h>
 2 using namespace std;
 3 struct Point {
 4     double x,y,w;
 5 } p[200];
 6 double sum[200];
 7 bool cmpx(const Point &a,const Point &b) {
 8     return a.x < b.x;
 9 }
10 bool cmpy(const Point &a,const Point &b) {
11     return a.y < b.y;
12 }
13 int main() {
14     int kase,n;
15     scanf("%d",&kase);
16     while(kase--) {
17         scanf("%d",&n);
18         for(int i = 0; i < n; ++i)
19             scanf("%lf %lf %lf",&p[i].x,&p[i].y,&p[i].w);
20         sort(p,p+n,cmpx);
21         sum[0] = p[0].w;
22         for(int i = 1; i < n; ++i)
23             sum[i] = p[i].w + sum[i-1];
24         double total = sum[n-1],x,y;
25         for(int i = 0; i < n; ++i) {
26             double left = i?sum[i-1]:0;
27             double right = sum[n-1] - sum[i];
28             if(left <= 0.5*total && right <= 0.5*total) {
29                 x = p[i].x;
30                 break;
31             }
32         }
33         sort(p,p+n,cmpy);
34         sum[0] = p[0].w;
35         for(int i = 1; i < n; ++i)
36             sum[i] = sum[i-1] + p[i].w;
37         for(int i = 0; i < n; ++i) {
38             double left = i?sum[i-1]:0;
39             double right = sum[n-1] - sum[i];
40             if(left <= 0.5*total && right <= 0.5*total) {
41                 y = p[i].y;
42                 break;
43             }
44         }
45         double ret = 0;
46         for(int i = 0; i < n; ++i)
47             ret += p[i].w*(fabs(p[i].x - x) + fabs(p[i].y - y));
48         printf("%.6f %.6f %.6f\n",x,y,ret);
49     }
50     return 0;
51 }