e<cstdio>

#include<cmath>

#include<algorithm>

using namespace std;

typedef pair<int,int> PII;

const int maxn=;

PII p[maxn];

int n,cas;

double dis[maxn][maxn];

double getdis(PII p1,PII p2){

    return sqrt((p1.first-p2.first)*(p1.first-p2.first)*1.0+

            (p1.second-p2.second)*(p1.second-p2.second)*1.0);

}

int main(){

    while(scanf("%d",&n),n){

        for(int i=;i<=n;++i){

            int x,y;

            scanf("%d%d",&x,&y);

            p[i]=make_pair(x,y);

        }

        for(int i=;i<=n;++i){

            dis[i][i]=0.0;

            for(int j=i+;j<=n;++j)

                dis[i][j]=dis[j][i]=getdis(p[i],p[j]);

        }

        for(int k=;k<=n;++k)

            for(int i=;i<=n;++i)

                for(int j=;j<=n;++j)

                    dis[i][j]=min(dis[i][j],max(dis[i][k],dis[k][j]));

        printf("Scenario #%d\n",++cas);

        printf("Frog Distance = %.3f\n\n",dis[][]);

    }

    return ;

}