#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<cstdlib>
#include<random>
#define N 301
#define M 100000
using namespace std;
mt19937 RAND(random_device{}());
const double Pi=asin(1)*2;
const double inf=1e6;
const double INF=1e25;
const double eps=1e-9;
int read()
{
	char c=0;
	int sum=0,f=1;
	while (c!='-'&&(c<'0'||c>'9')) c=getchar();
	if (c=='-') c=getchar(),f=-1;
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum*f;
}
struct points
{
	int x,y;
	bool operator < (const points &t)const
	{
		return y!=t.y?y<t.y:x<t.x;
	}
};
points zero,ds,st[N+1];
points operator + (points a,points b)
{
	return (points){a.x+b.x,a.y+b.y};
}
points operator - (points a,points b)
{
	return (points){a.x-b.x,a.y-b.y};
}
long long operator * (points a,points b)
{
	return 1ll*a.x*b.y-1ll*a.y*b.x;
}
struct reads
{
	int x,y;
	points d;
	double ds;
	bool operator < (const reads &t)const
    {
		return ds<t.ds;
	}
};
reads tong[M+1];
struct rds
{
	int num,cl;
	double data;
	bool operator < (const rds &t)const
	{
		return abs(data-t.data)>eps?data<t.data:cl<t.cl;
	}
};
double ans,arcd[N+1][N+1],dp[M+1],DP[N+1],arc[N+1],delta[N+1][N+1],w[M+1],sdelta[N+1][N+1],sdelta2[N+1][N+1];
int T,n,length,p[N+1],P[N+1],num[N+1][N+1];
long long dst[N+1][N+1];
bool used[N+1][N+1];
vector<rds>v[N+1];
bool checks(points a,points b,points c)
{
	return (b-a)*(c-a)>=0;
}
double MD(double x)
{
	if (x>=2*Pi) x-=2*Pi;
	if (x<0) x+=2*Pi;
	return x;
}
double calc(points a)
{
	if (a.x>0) return MD(atan(1.0*a.y/a.x));
	else if (a.x==0) return a.y>0?Pi/2:3*Pi/2;
	else return MD(atan(1.0*a.y/a.x)+Pi);
}
double calc2(points a)
{
	return MD(calc(a)-3*Pi/2);
}
void adder(int x,int y,double ds,double d)
{
	DP[x]=max(DP[x],ds+sdelta2[x][y]*d);
	return;
}
double query(int x,int y,double d)
{
	return DP[x]-sdelta[x][y]*d;
}
bool check_line(double x,double y,double z)
{
	if (x<=z) return x<=y&&y<=z;
	else return x<=y||y<=z;
}
bool cmp(int x,int y)
{
	return arc[x]<arc[y];
}
bool check(int x,double d)
{
	if (x==n-1||x==n) return 0;
	double sw,res=0,rst,minn;
	ds=st[x];
	for (int i=1;i<=n;++i)
		for (int j=1;j<=n;++j)
			used[i][j]=0;
	for (int i=1;i<=n;++i) DP[i]=-INF;
	for (int i=x+1;i<=n;++i) P[i]=i,arc[i]=arcd[x][i];
	sort(P+x+1,P+n+1,cmp);
	for (int i=x+1;i<=n;++i)
	{
		minn=INF;
		for (int j=i+1;j<=n;++j)
			if (MD(arcd[P[i]][x]-arcd[P[i]][P[j]])<minn)
				minn=MD(arcd[P[i]][x]-arcd[P[i]][P[j]]),used[P[i]][P[j]]=used[P[j]][P[i]]=1;
	}
	for (int i=x+1;i<=n;++i) used[x][i]=used[i][x]=1;
	for (int i=1;i<=length;++i)
		if (tong[i].x>=x&&tong[i].y>=x&&used[tong[i].x][tong[i].y])
		{
			rst=abs((st[tong[i].x]-st[x])*(st[tong[i].y]-st[x])/2.0),dp[i]=rst+query(tong[i].x,tong[i].y,d)-w[i]*d;
			if (tong[i].x==x)
			{
				if (tong[i].ds>=0)
				{
					sw=MD(tong[i].ds-Pi/2-eps),res=0;
					if (tong[i].ds>0)
					{
						for (int j=0;j<v[x].size();++j)
							if (v[x][j].num!=tong[i].x&&v[x][j].num!=tong[i].y&&v[x][j].cl==1&&check_line(3*Pi/2,arcd[x][v[x][j].num],sw))
								res+=delta[x][v[x][j].num];
					}
					dp[i]=max(dp[i],rst-(res+w[i])*d);
				}
			}
			adder(tong[i].y,tong[i].x,dp[i],d);
			if (tong[i].y==x)
			{
				if (tong[i].ds>=0)
				{
					sw=MD(tong[i].ds-Pi/2+eps),res=0;
					for (int j=0;j<v[x].size();++j)
						if (v[x][j].num!=tong[i].x&&v[x][j].num!=tong[i].y&&v[x][j].cl==1&&check_line(sw,arcd[x][v[x][j].num],3*Pi/2-eps))
							res+=delta[x][v[x][j].num];
					if (dp[i]-res*d>0) return 1;
				}
			}
		}
	return 0;
}
int main()
{
	double l,r,mid,rest;
	T=read();
	while (T--)
	{
		n=read(),length=ans=0;
		for (int i=1;i<=n;++i) st[i].x=read(),st[i].y=read(),p[i]=i,v[i].clear();
		sort(st+1,st+n+1);
		for (int i=1;i<=n;++i)
			for (int j=1;j<=n;++j)
			{
				dst[i][j]=1ll*(st[i].x-st[j].x)*(st[i].x-st[j].x)+1ll*(st[i].y-st[j].y)*(st[i].y-st[j].y),delta[i][j]=sqrt(dst[i][j]),arcd[i][j]=calc(st[j]-st[i]);
				if (i!=j) v[i].push_back((rds){j,1,calc2(st[j]-st[i])}),v[i].push_back((rds){j,0,MD(calc2(st[j]-st[i])-Pi/2)}),v[i].push_back((rds){j,2,MD(calc2(st[j]-st[i])+Pi/2)});
			}
		for (int i=1;i<=n;++i)
		{
			sort(v[i].begin(),v[i].end()),rest=0;
			for (int j=0;j<v[i].size();++j)
			{
				if (v[i][j].cl==1) rest+=delta[i][v[i][j].num];
				else if (!v[i][j].cl) sdelta[i][v[i][j].num]=rest;
				else sdelta2[i][v[i][j].num]=rest;
			}
		}
		for (int i=1;i<=n;++i)
			for (int j=1;j<=n;++j)
				if (i!=j)
					tong[++length]=(reads){i,j,st[j]-st[i],calc(st[j]-st[i])};
		sort(tong+1,tong+length+1);
		for (int i=1;i<=length;++i)
		{
			w[i]=delta[tong[i].x][tong[i].y];
			for (int j=1;j<=n;++j)
				if (checks(st[tong[i].x],st[j],st[tong[i].y])&&dst[tong[i].x][j]+dst[tong[i].x][tong[i].y]>=dst[tong[i].y][j]&&dst[tong[i].y][j]+dst[tong[i].x][tong[i].y]>=dst[tong[i].x][j])
					w[i]+=min(delta[tong[i].x][j],delta[tong[i].y][j]);
		}
		shuffle(p+1,p+n+1,RAND);
		for (int i=1;i<=n;++i)
			if (check(p[i],ans+eps))
			{
				l=ans,r=inf;
				for (int j=1;j<=40;++j)
				{
					mid=(l+r)/2;
					if (check(p[i],mid)) l=mid;
					else r=mid;
				}
				ans=(l+r)/2;
			}
		printf("%0.12lf\n",ans);
	}
	return 0;
}