/*   @JUDGE_ID:   1705PZ   534   C */
#include <stdio.h>
#include <math.h>
#define MAXSTONE 200

float big(float x,float y){
	if(x >= y)
		return x;
	else
		return y;
	}

int main(){
int i,j,k,n,count = 0;
float stone[MAXSTONE][2],dis[MAXSTONE][MAXSTONE];
while(1){
	scanf("%d",&n);
	if(n == 0)
		break;
	for(i = 0;i < n;i++)
		scanf("%f %f",&stone[i][0],&stone[i][1]);
	for(i = 0;i < n;i++)
		for(j = 0;j < n;j++)
			dis[i][j] = pow((stone[i][0] - stone[j][0]),2) + pow((stone[i][1] - stone[j][1]),2);
	for(k = 0;k < n;k++)
		for(i = 0;i < n;i++)
			for(j = 0;j < n;j++)
				if(dis[i][k] < dis[i][j] && dis[k][j] < dis[i][j])
					dis[i][j] = big(dis[i][k],dis[k][j]);
	printf("Scenario #%d\n",++count);
	printf("Frog Distance = %.3f\n\n",pow(dis[0][1],0.5));
	}
return 0;
}
@END_OF_SOURCE_CODE

