#include<iostream>

 #include<cstdio>

 #include<queue>

 #include<cmath>

 #include<cstring>

 using namespace std;

 #define inf 999999999

 double e[][];

 struct node

 {

     int x,y;

 }P[];

 double dis(node A,node B)

 {

     double d1=(A.x-B.x)*(A.x-B.x),d2=(A.y-B.y)*(A.y-B.y);

     return sqrt(d1+d2);

 }

 double dij(int N)

 {

  double d[];

  bool vis[];

  memset(vis,,sizeof(vis));

  for(int i=;i<=N;++i) d[i]=inf;

  d[]=;

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

  {

      int u;

      double minv=inf;

      for(int j=;j<=N;++j) if(!vis[j]&&d[j]<minv) minv=d[u=j];

      vis[u]=;

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

         if(!vis[j]&&d[j]>d[u]+e[u][j])

         d[j]=d[u]+e[u][j];

  }

  return d[];

 }

 int main()

 {

     freopen("in.txt","r",stdin);

     int N,M,i,j,k;

     double v1=10000.0/;

     double v2=40000.0/;

     while(cin>>P[].x>>P[].y>>P[].x>>P[].y){

         int p=,l=,a,b;

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

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

         e[i][j]=(i==j?:inf);

         while(cin>>a>>b){

             if(a==-&&b==-) {l=p+;continue;}

             ++p;

             P[p].x=a;

             P[p].y=b;

             if(p>l) e[p-][p]=e[p][p-]=min(e[p][p-],dis(P[p],P[p-])/v2);

         }

         for(i=;i<=p;++i)

             for(j=i+;j<=p;++j)

                  e[i][j]=e[j][i]=min(e[i][j],dis(P[i],P[j])/v1);

         printf("%.0f\n",dij(p));

     }

     return ;

 }