#include <iostream>

#include <queue>

#include <cstdio>

#include <vector>

#include <cstring>

#include <cmath>

#include <algorithm>

using namespace std;

#define pb push_back

#define fi first

#define se second

typedef long long ll;

const ll INF = 1e9+ ;

const int maxn  =  ;

ll n, m, k, s;

double dis[maxn];

bool vis[maxn];

vector < pair<ll, double > > mp[maxn];

priority_queue< pair<double ,ll > > q;

struct node {

    int x,y;

}ac[];

double omyway(int i,int j)

{

    node a = ac[i],b = ac[j];

    return sqrt( 1.0*(a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y) );

}

void dij(){

    memset(vis,,sizeof(vis));

    while(!q.empty())

    {

            int v = q.top().se;

            q.pop();

            if(vis[v])continue;

            vis[v] = ;

            for(int i=;i<mp[v].size();i++)

            {

                int tmp = mp[v][i].fi;

                double tmpc = mp[v][i].se;

                if(dis[tmp] > max(dis[v],tmpc))

                {

                    dis[tmp] = max(dis[v] , tmpc);

                    q.push(make_pair(-1.0*dis[tmp],tmp));

                }

            }

    }

}

int main(){

    int cnt = ;

    while(~scanf("%lld", &n) && n)

    {

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

            mp[i].clear(), dis[i]=INF;

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

        {

           int x,y;

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

           ac[i].x=x;

           ac[i].y=y;

        }

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

        {

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

            {

                double tmp = omyway(i,j);

                mp[i].push_back(make_pair(j,tmp));

                mp[j].push_back(make_pair(i,tmp));

            }

        }

        dis[] = 0.0;

        q.push(make_pair(0.0,));

        dij();

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

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

    }

    return ;

}