#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> P;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<62;
double pi=3.141592653589793238462643383279L;
double eps=1e-14;
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto& itr:mp)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<ll,ll,custom_hash>
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll poc(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}
struct MaST{
private:
    ll n;
    vector<pll> dat;
public:
    MaST(vector<ll> v){
        ll sz=v.size();
        n=1;while(n<sz)n*=2;
        pll p={-inf,-inf};
        dat.resize(2*n-1,p);
        rep(i,0,sz)dat[i+n-1]={v[i],i};
        rrep(i,n-2,0){
            dat[i]=max(dat[i*2+1],dat[i*2+2]);
        }
    }
    void add(ll k,ll x){
        ll i=k+n-1;
        dat[i]={x,k};
        while(i>0){
            i=(i-1)/2;
            dat[i]=max(dat[2*i+1],dat[2*i+2]);
        }
    }
    pll que(ll a,ll b,ll k=0,ll l=0,ll r=-1){
        if(r<0)r=n;
        if(b<=l||a>=r)return {-inf,-inf};
        if(a<=l&&b>=r)return dat[k];
        pll m1=que(a,b,2*k+1,l,(l+r)/2);
        pll m2=que(a,b,2*k+2,(l+r)/2,r);
        return max(m1,m2);
    }
};
bool ok(int sx,int sy,int gx,int gy,int x,int y){
    if(sx<=x&&gx>=x&&sy<=y&&gy>=y)return true;
    else return false;
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    int sx,sy,gx,gy;
    cin>>sx>>sy>>gx>>gy;
    int kx=1,ky=1;
    if(sx>gx){
        sx=-sx;
        gx=-gx;
        kx=-1;
    }
    if(sy>gy){
        sy=-sy;
        gy=-gy;
        ky=-1;
    }
    int kk=0;
    int sax=gx-sx,say=gy-sy;
    if(sax<say){
        gx=sx+say;
        gy=sy+sax;
        kk=1;
    }
    int n;cin>>n;
    vector<ppii> v;
    vector<int> w;
    rep(i,0,n){
        int x,y;cin>>x>>y;
        x*=kx;
        y*=ky;
        if(kk){
            sax=x-sx,say=y-sy;
            x=sx+say,y=sy+sax;
        }
        int pax=x,pay=y-1,nex=x+1,ney=y;
        if(ok(sx,sy,gx,gy,pax,pay)&&ok(sx,sy,gx,gy,nex,ney)){
            v.push_back({{nex,ney},0});
            v.push_back({{pax,pay},1});
            w.push_back(pay);
            w.push_back(ney);
        }
        pax=x-1,pay=y,nex=x,ney=y+1;
        if(ok(sx,sy,gx,gy,pax,pay)&&ok(sx,sy,gx,gy,nex,ney)){
            v.push_back({{nex,ney},0});
            v.push_back({{pax,pay},1});
            w.push_back(pay);
            w.push_back(ney);
        }
        if(x==gx&&y>sy&&y<gy){
            v.push_back({{x,y-1},2});
            w.push_back(y-1);
        }
        if(y==gy&&x>sx&&x<gx){
            v.push_back({{x-1,y},3});
            w.push_back(y);
        }
    }
  if(w.size()==0){
    cout<<(ll)((gx-sx)+(gy-sy))*100<<endl;
    return 0;
  }
    sort(w.begin(),w.end());
    w.erase(unique(w.begin(),w.end()),w.end());
    map<int,int> mp;
    rep(i,0,w.size())mp[w[i]]=i;
    sort(v.begin(),v.end());
    int m=w.size();
    MaST seg0(vector<ll>(m,-1)),seg1(vector<ll>(m,-1));
    map<pii,int> mp20,mp21;
  
    seg0.add(m-1,(ll)0);
    rrep(i,v.size()-1,0){
        int num=v[i].second,nx=v[i].first.first,ny=v[i].first.second;
       // cout<<num<<" "<<nx<<" "<<ny<<endl;
       /* rep(j,0,m){
            cout<<seg0.que(j,j+1).first<<" ";
        }
        cout<<endl;*/
        int nny=mp[ny];
        if(num==0){
            pll p=seg0.que(nny,m);
            int ax=p.first;
            //if(nx==5&&ny==3)cout<<ax<<endl;
            if(ax>=0)ax++;
            mp20[{nx-1,ny-1}]=ax;
            p=seg1.que(nny,m);
            ax=p.first;
            if(ax>=0)ax++;
            mp21[{nx-1,ny-1}]=ax;
        }
        else if(num==1){
           // if(nx==4&&ny==2)cout<<nny<<" "<<mp20[{nx,ny}]<<endl;
            seg0.add(nny,mp20[{nx,ny}]);
            seg1.add(nny,mp21[{nx,ny}]);
        }
        else if(num==2){
            seg1.add(nny,0);
        }
        else{
            seg1.add(m-1,0);
            seg0.add(m-1,-1);
        }
    }
    //cout<<m<<endl;
  
    pll p=seg0.que(0,m);
    ll h=p.first;
    double ans=1000000000000000;
   // cout<<h<<endl;
    if(h>=0){
        double sum=((gx-sx)+(gy-sy))*100.0;
        sum-=1.0*h*(20.0-5*pi);
        Min(ans,sum);
    }
    p=seg1.que(0,m);
    h=p.first;
   // cout<<h<<endl;
    if(h>=0){
        double sum=((gx-sx)+(gy-sy))*100.0;
        sum-=1.0*h*(20.0-5*pi);
        sum+=10*pi-20.0;
        Min(ans,sum);
    }
    cout<<fixed<<setprecision(12)<<ans<<endl;
}




Measured memory_bytes: 158504