hdu1875
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<stack>
using namespace std;
#define ll long long
#define cl(a,b) memset(a,b,sizeof(a))
#define N 50005
#define MAXN 100005
#define mod 1000000007
#define INF 999999
struct island{
int x,y;
}a[120];
struct node{
int u,v;
double w;
}edge[10005];
bool cmp(node a,node b)
{
return a.w<b.w;
}
int pre[120];
int Find(int x)
{
if(x==pre[x])return x;
return pre[x]=Find(pre[x]);
}
bool join(int x,int y)
{
int fx=Find(x);
int fy=Find(y);
if(fx!=fy)
{
pre[fx]=fy;
return 1;
}
return 0;
}
int main()
{
int t,n,k;
double x,y;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
pre[i]=i;
for(int i=1;i<=n;i++)
scanf("%d%d",&a[i].x,&a[i].y);
k=0;
for(int i=1;i<n;i++)
for(int j=i+1;j<=n;j++)
{
edge[k].u=i;
edge[k].v=j;
x=(a[j].y-a[i].y)*(a[j].y-a[i].y);
y=(a[j].x-a[i].x)*(a[j].x-a[i].x);
edge[k++].w=sqrt(x+y);
}
sort(edge,edge+k,cmp);
double sum=0;
for(int i=0;i<k;i++)
{
if(edge[i].w<=1000&&edge[i].w>=10&&join(edge[i].u,edge[i].v))
{
sum+=edge[i].w;
}
}
int cnt=0;
bool flag=0;
for(int i=1;i<=n;i++)
{
if(i==pre[i])cnt++;
if(cnt>1)
{
flag=1;
break;
}
}
if(flag)printf("oh!\n");
else printf("%.1lf\n",sum*100);
}
return 0;
}