三分模板.

#include <bits/stdc++.h>
using namespace  std;
//#define  int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1ll<<62
#define endl "\n"
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
#define eps 1e-9
int n, m , k;
double a[N];
double b[N];
double c[N];
double   cal(double x) {
	double ans = 0;
	for(int i = 1; i <= n; i++) {
		ans = max(ans, a[i] * 1.0 * x * x + b[i] * x * 1.0 + c[i]);
	}
	return ans;
}
void solve() {
	cin >> n;
	fer(i, 1, n) {
		cin >> a[i] >> b[i] >> c[i];
	}
	double l = 0;
	double r = 1000;
	double ans;
	while(fabs(r - l) > eps) {
		double mid1 = l + (r - l) / 3;
		double mid2 = r - (r - l) / 3;
		double t1 = cal(mid1);
		double t2 = cal(mid2);
		if(t1 > t2)  l = mid1;
		else  r = mid2;
	}
	cout << setiosflags(ios::fixed) << setprecision (4) << cal(l) << endl;

}
int main() {
	IOS;
	int _ ;
	cin >> _;
	while( _-- )
		solve();
}