#include <math.h>
#include <stdio.h>
#define N 100
#define INF 1000000
int index1,index2;
struct Point//使用蛮力法求平面中距离最近的两点
{
double x, y;
}point[N];
double BruteForceClosePoints(int n)
{
double dmin = INF;
int i , j;
for(i = 0 ; i < n; i++)
{
for(j = i + 1; j < n ; j++)
{
double d = sqrt( (point[i].x - point[j].x) * ( point[i].x - point[j].x)
+ (point[i].y - point[j].y) * (point[i].y - point[j].y));
if(d < dmin)
{
dmin = d;
index1 = i;
index2 = j;
}
}
}
return dmin;
}
int main()
{
int m , n ;
double dmin;
scanf("%d" , &n);
while(n--)
{
scanf("%d", &m);
for(int i = 0;i < m ;i++)
{
scanf("%lf %lf",&point[i].x, &point[i].y);
}
dmin = BruteForceClosePoints(m);
printf("%d %d %lf",index1,index2,dmin);
}
return 0;
}