shortestPath

#include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
double dist[205][205],value[205];
int visited[205],path[205],s[205][2];
double distance(double x1,double y1,double x2,double y2)
{
    return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}    
int main()
{
    int i,j,n,count=0;
    while(cin>>n)
    {
        if(n==0)break;
        count++;
        memset(s,0,sizeof(s));
        memset(dist,0,sizeof(dist));
        for(i=1;i<=n;i++)
        {
            cin>>s[i][0]>>s[i][1];
        }
        for(i=1;i<=n;i++)
        for(j=i;j<=n;j++)
        {
            if(i==j)dist[i][j]=0;
            else dist[i][j]=dist[j][i]=distance(s[i][0],s[i][1],s[j][0],s[j][1]);
        }
        visited[1]=1;
        path[1]=-1;
        for(i=2;i<=n;i++)
        {
            value[i]=dist[1][i];
            path[i]=1;
            visited[i]=0;
        }
        value[1]=0.0;
        double mindist;
        for(i=1;i<n;i++)
        {
            mindist=9999999.0;
            int u;
            for(j=2;j<=n;j++)
            {
                if(value[j]<mindist&&!visited[j])
                {
                    mindist=value[j];
                    u=j;
                }
            }
            visited[u]=1;
            for(j=2;j<=n;j++)
            {
                if(mindist + dist[u][j]<value[j]&&!visited[j])
                {
                    value[j]=mindist + dist[u][j];
                    path[j]=u;
                }
            }
        }
        
        cout<<showpoint<<fixed<<setprecision(3);
        cout<<"Scenario #"<<count<<endl;
        cout<<"Frog Distance = "<<value[2]<<endl;
        cout<<endl;
    }
    return 0;
}