#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<cmath>

 using namespace std;

 const double v1=10000.0/;

 const double v2=40000.0/;

 int n;

 const int maxn=+;

 double dist[maxn];

 double cost[maxn][maxn];

 int vis[maxn];

 const double INF=1e30;

 struct Node{

     double x,y;

 }node[maxn];

 double dis(const Node&a,const Node&b){

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

 }

 void Dijkstra(){

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

         dist[i]=INF;

     }

     memset(vis,,sizeof(vis));

     dist[]=;

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

         int k=-;

         double minnum=INF;

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

             if(!vis[i]&&dist[i]<minnum){

                 minnum=dist[i];

                 k=i;

             }

         }

         if(k==-)break;

     vis[k]=;

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

         if(!vis[i]&&dist[k]+cost[k][i]<dist[i]){

             dist[i]=dist[k]+cost[k][i];

     }

     }

 }

 }

 int main(){

     while(scanf("%lf%lf%lf%lf",&node[].x,&node[].y,&node[].x,&node[].y)==){

         n=;

     int cnt1=;

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

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

                 if(i!=j)cost[i][j]=INF;

                 else cost [i][j]=;

         int x,y;

         bool ok=;

         while(scanf("%d%d",&x,&y)==){

             if(x==-&&y==-){

             ok=;

                 continue;

             }

             n++;

             node[n].x=x;

             node[n].y=y;

             if(ok){

                 cost[n][n-]=cost[n-][n]=min(cost[n][n-],dis(node[n],node[n-])/v2);

             }

             ok=;

         }

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

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

                cost[i][j]=cost[j][i]=min(cost[i][j],dis(node[i],node[j])/v1);

             }

         Dijkstra();

     cout << int( dist[] + 0.5 );

     }

     return ;

 }