#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(1);
#define N 1005
using db=double;
const db inf=1e18;
const db eps=1e-9;
int sgn(int x)
{
	if(x<0) return -1;
	else if(x>0) return 1;
	else return 0;
}
struct Vec
{
	int x,y;
	Vec(int a=0,int b=0) {x=a,y=b;}
	db abs() {return sqrt(x*x+y*y);}
	db norm() {return x*x+y*y;}
};
Vec operator + (Vec x,Vec y) {return Vec(x.x+y.x,x.y+y.y);}
Vec operator - (Vec x,Vec y) {return Vec(x.x-y.x,x.y-y.y);}
int cdot(Vec x,Vec y) {return x.x*y.x+x.y*y.y;}
int cross(Vec x,Vec y) {return x.x*y.y-x.y*y.x;}
int half(Vec v) {return v.y<0||(v.y==0&&v.x<0);}
int cmp(Vec x,Vec y)
{
	return half(x)==half(y)?cross(x,y)>0:half(y);
}
Vec a[N];
int n;
struct Edge
{
	int i,j;
	Vec get() {return a[j]-a[i];}
};
bool cmpseg(Edge x,Edge y)
{
	Vec A=x.get(),B=y.get();
	if(!cmp(A,B)&&!cmp(B,A)) return cdot(a[x.i],A)<cdot(a[y.i],A);
	else return cmp(A,B);
}
db f[N],siz[N][N],len[N][N];
vector<Edge> edges;
int chk(int s,db mid)
{
	for(int i=0;i<n;i++) f[i]=-inf;
	f[s]=0;
	for(auto [u,v]:edges)
	{
		db tv=f[u]+siz[u][v]-len[u][v]*mid;
		f[v]=max(f[v],tv);
	}
	return f[s]>eps;
}
void work()
{
	cin>>n;
	for(int i=0;i<n;i++) cin>>a[i].x>>a[i].y;
	edges.clear();
	for(int i=0;i<n;i++) for(int j=0;j<n;j++) if(i!=j) edges.push_back({i,j});
	sort(edges.begin(),edges.end(),cmpseg);
	vector<int> nds(n);
	for(int i=0;i<n;i++) nds[i]=i;
	shuffle(nds.begin(),nds.end(),rnd);
	db ans=0;
	for(int i=0;i<n;i++) for(int j=0;j<n;j++) siz[i][j]=cross(a[i],a[j]),len[i][j]=(a[i]-a[j]).norm();
	for(int i:nds)
	{
		if(!chk(i,ans+eps)) continue;
		db l=0,r=4e8;
		for(int j=0;j<60;j++)
		{
			db mid=(l+r)/2;
			if(chk(i,mid)) l=mid;
			else r=mid;
		}
		ans=l;
	}
	printf("%.10lf\n",ans/2);
}
signed main() {
#ifdef xay5421
	freopen("b.in","r",stdin);
#endif
	int T; cin>>T;
	while(T--) work();
	return 0;
}