//poj 2253
#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<string>
#include<stack>
#include<queue>
#define MAXP(x,y) (((x)>(y))?(x):(y))
#define MINP(x,y) (((x)<(y))?(x):(y))
const int MAX=0xfffffff;
using namespace std;
const int mx=220;
struct node{
int x,y;
}v[mx];
double dist[mx];
bool vis[mx];
int n;
double dis(node v1,node v2)
{
return sqrt(double(v1.x-v2.x)*(v1.x-v2.x)+double(v1.y-v2.y)*(v1.y-v2.y));
}
void dijkstra( )
{
memset(vis,0,sizeof(vis));
for(int i=0;i<n;i++)
dist[i]=MAX;
vis[0]=1;
dist[0]=0;
for(int i=1;i<n;i++)
{
int min=MAX;
int k=0;
for(int j=0;j<n;j++)
{
if(!vis[j]&&dist[j]<min)
{
min=dist[j];
k=j;
}
}
vis[k]=1;
if(k==1) break;
for(int j=0;j<n;j++)
{
if(!vis[j]&&dist[j]>MAXP(dist[k],dis(v[k],v[j])));
dist[j]=MAXP(dist[k],dis(v[k],v[j]));
}
}
}
int main( )
{
freopen("1.txt","r",stdin);
int k=1;
while(cin>>n&&n)
{
for(int i=0;i<n;i++)
cin>>v[i].x>>v[i].y;
dijkstra( );
cout<<"Scenario #"<<k++<<endl<<"Frog Distance = ";
printf("%.3lf\n\n",dist[1]);
}
return 0;
}
#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<string>
#include<stack>
#include<queue>
#define MAXP(x,y) (((x)>(y))?(x):(y))
#define MINP(x,y) (((x)<(y))?(x):(y))
const int MAX=0xfffffff;
using namespace std;
const int mx=220;
struct node{
int x,y;
}v[mx];
double dist[mx];
bool vis[mx];
int n;
double dis(node v1,node v2)
{
return sqrt(double(v1.x-v2.x)*(v1.x-v2.x)+double(v1.y-v2.y)*(v1.y-v2.y));
}
void dijkstra( )
{
memset(vis,0,sizeof(vis));
for(int i=0;i<n;i++)
dist[i]=MAX;
vis[0]=1;
dist[0]=0;
for(int i=1;i<n;i++)
{
int min=MAX;
int k=0;
for(int j=0;j<n;j++)
{
if(!vis[j]&&dist[j]<min)
{
min=dist[j];
k=j;
}
}
vis[k]=1;
if(k==1) break;
for(int j=0;j<n;j++)
{
if(!vis[j]&&dist[j]>MAXP(dist[k],dis(v[k],v[j])));
dist[j]=MAXP(dist[k],dis(v[k],v[j]));
}
}
}
int main( )
{
freopen("1.txt","r",stdin);
int k=1;
while(cin>>n&&n)
{
for(int i=0;i<n;i++)
cin>>v[i].x>>v[i].y;
dijkstra( );
cout<<"Scenario #"<<k++<<endl<<"Frog Distance = ";
printf("%.3lf\n\n",dist[1]);
}
return 0;
}