#include<bits/stdc++.h>
using namespace std;
#define N 1000100
struct vec{
	int x,y;
};
int n;
vec a[N];
double dist(vec a,vec b){
	double x=a.x-b.x,y=a.y-b.y;
	return sqrt(x*x+y*y);
}
double calc(vec a,vec b,vec c){
	return dist(a,b)+dist(b,c)+dist(c,a);
}
namespace h{
	struct node{
		int xid,yid,nxt;
	}d[N<<1];
	int head[N],tot=1;
	vector<int> vis;
	vector<int> dt[N];
	void clear(){
		for(int id:vis){
			int u=head[id];head[id]=0;
			while(u){
				dt[u].clear();dt[u].shrink_to_fit();
				int v=d[u].nxt;
				d[u].xid=d[u].yid=d[u].nxt=0;
				u=v;
			}
		}
		vis.clear();tot=1;
	}
	int zget(double x){
		if(x>=0)return (int)x;
		else return -(int)(-x)-1;
	}
	int getnode(int xid,int yid){
		long long hsh=((1LL*xid*1145141919LL+yid)%N+N)%N;
		int u=head[hsh];
		while(u){
			if(d[u].xid==xid&&d[u].yid==yid){
				return u;
			}
			u=d[u].nxt;
		}
		return -1;
	}
	void insert(int idx,double C){
		vec z=a[idx];
		int xid=zget(z.x/C),yid=zget(z.y/C);
		long long hsh=((1LL*xid*1145141919LL+yid)%N+N)%N;
		int u=getnode(xid,yid);
		if(u==-1){
			int u=tot++;d[u].xid=xid;d[u].yid=yid;d[u].nxt=head[hsh];
			if(!d[u].nxt)vis.push_back(hsh);
			head[hsh]=u;dt[u].push_back(idx);
		}else{
			dt[u].push_back(idx);
		}
	}
};
void build(double C,int m){
	h::clear();
	for(int i=1;i<=m;i++){
		h::insert(i,C);
	}
}
int dir[9][2]={
	{-1,-1},{-1,0},{-1,1},{0,-1},{0,0},{0,1},{1,-1},{1,0},{1,1}
};
vector<int> tmp;
int work(int tid){
	//freopen("triangle.in","r",stdin);
	//freopen("triangle.out","w",stdout);
	h::clear();tmp.clear();
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d%d",&(a[i].x),&(a[i].y));
	random_shuffle(a+1,a+n+1);
	double ans=calc(a[1],a[2],a[3]);
	build(ans/2,3);
	//printf("init ans=%lf\n",ans);
	for(int i=4;i<=n;i++){
		if(ans<1e-6)break;
		int xid=h::zget(a[i].x/(ans/2)),yid=h::zget(a[i].y/(ans/2));
		tmp.clear();
		for(int j=0;j<9;j++){
			int nx=xid+dir[j][0],ny=yid+dir[j][1];
			int id=h::getnode(nx,ny);if(id==-1)continue;
			for(int idx:h::dt[id]){
				if(dist(a[i],a[idx])<ans/2)tmp.push_back(idx);
			}
		}
		double tans=ans;
		for(int j=0;j<tmp.size();j++){
			for(int k=j+1;k<tmp.size();k++){
				tans=min(tans,calc(a[i],a[tmp[j]],a[tmp[k]]));
			}
		}
		if(tans+1e-9<ans){
			//printf("ans=%lf,tans=%lf\n",ans,tans);
			ans=tans;
			build(ans/2,i);
		}else{
			h::insert(i,ans/2);
		}
	}
	printf("Case #%d: %lf\n",tid,ans);
	return 0;
}
int main(){
	int t;scanf("%d",&t);
	for(int i=1;i<=t;i++)work(i);
}