// {{{ by shik
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x),end(x)
#define RALL(x) rbegin(x),rend(x)
#define REP(i,n) for ( int i=0; i<int(n); i++ )
#define REP1(i,a,b) for ( int i=(a); i<=int(b); i++ )
#define MP make_pair
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

template<class T> void _R( T &x ) { cin>>x; }
void _R( int &x ) { scanf("%d",&x); }
void _R( int64_t &x ) { scanf("%" PRId64,&x); }
void _R( double &x ) { scanf("%lf",&x); }
void _R( char &x ) { scanf(" %c",&x); }
void _R( char *x ) { scanf("%s",x); }
void R() {}
template<class T, class... U> void R( T& head, U&... tail ) { _R(head); R(tail...); }

template<class T> void _W( const T &x ) { cout<<x; }
void _W( const int &x ) { printf("%d",x); }
void _W( const int64_t &x ) { printf("%" PRId64,x); }
void _W( const double &x ) { printf("%.16f\n",x); }
void _W( const char &x ) { putchar(x); }
void _W( const char *x ) { printf("%s",x); }
template<class T> void _W( const vector<T> &x ) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W( const T& head, const U&... tail ) { _W(head); putchar(sizeof...(tail)?' ':'\n'); W(tail...); }

template<class T> inline bool chkmax( T &a, const T &b ) { return b>a ? a=b,true : false; }
template<class T> inline bool chkmin( T &a, const T &b ) { return b<a ? a=b,true : false; }
template<class T, class F=less<T>> void sort_uniq( vector<T> &v, F f=F() ) {
    sort(begin(v),end(v),f);
    v.resize(unique(begin(v),end(v))-begin(v));
}

template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;

#ifdef SHIK
template<class T> void _dump(const char *s, T &&head) { cerr << s << "=" << head << endl; }
template<class T, class... Args> void _dump(const char *s, T &&head, Args &&... tail) {
    for (int c = 0; *s != ',' || c != 0; cerr << *s++) {
        if (*s == '(' || *s == '[' || *s == '{') c++;
        if (*s == ')' || *s == ']' || *s == '}') c--;
    }
    cerr << "=" << head << ", ";
    _dump(s + 1, tail...);
}
#define dump(...) do { fprintf(stderr, "%s:%d - ", __PRETTY_FUNCTION__, __LINE__); _dump(#__VA_ARGS__, __VA_ARGS__); } while (0)

template<class Iter> ostream &_out(ostream &s, Iter b, Iter e) {
    s << "[";
    for (auto it = b; it != e; it++) s << (it == b ? "" : " ") << *it;
    return s << "]";
}

template<class A, class B> ostream &operator<<(ostream &s, const pair<A, B> &p) { return s << "(" << p.first << "," << p.second << ")"; }
template<class T> ostream &operator<<(ostream &s, const vector<T> &c) { return _out(s, ALL(c)); }
template<class T, size_t N> ostream &operator<<(ostream &s, const array<T, N> &c) { return _out(s, ALL(c)); }
template<class T> ostream &operator<<(ostream &s, const set<T> &c) { return _out(s, ALL(c)); }
template<class A, class B> ostream &operator<<(ostream &s, const map<A, B> &c) { return _out(s, ALL(c)); }
#else
#define dump(...)
#endif
// }}}

#define y1 y1_shik_magic

typedef long double Double;
const Double pi=acosl(-1);
const Double D1=20-5*pi;
const Double D2=10*pi-20;

const int N=2e5+10;
const LL L=1e8;

struct P {
    LL x,y;
} p[N];

bool operator <( const P &a, const P &b ) {
    return tie(a.x,a.y)<tie(b.x,b.y);
}

int n;
LL x1,y1,x2,y2;
int main() {
    R(x1,y1,x2,y2,n);
    REP(i,n) R(p[i].x,p[i].y);
    if ( x1>x2 ) {
        x1=L-x1;
        x2=L-x2;
        REP(i,n) p[i].x=L-p[i].x;
    }
    if ( y1>y2 ) {
        y1=L-y1;
        y2=L-y2;
        REP(i,n) p[i].y=L-p[i].y;
    }
    assert(x1<=x2 && y1<=y2);
    int nn=0;
    REP(i,n) if ( x1<=p[i].x && p[i].x<=x2 && y1<=p[i].y && p[i].y<=y2 ) p[nn++]=p[i];
    n=nn;
    Double base=((x2-x1)+(y2-y1))*100.0L;
    if ( x1==x2 || y1==y2 ) {
        Double ans=base;
        if ( n>0 ) ans+=D2;
        printf("%.14f\n",(double)ans);
        return 0;
    }
    vector<LL> v;
    sort(p,p+n);
    REP(i,n) {
        LL t=p[i].y;
        dump(i,p[i].x,p[i].y);
        if ( v.empty() || t>v.back() ) v.PB(t);
        else *lower_bound(ALL(v),t)=t;
    }
    dump(v);
    Double ans=base-SZ(v)*D1;
    if ( min(x2-x1,y2-y1)+1==SZ(v) ) ans+=D1+D2;
    dump(n);
    printf("%.14f\n",(double)ans);
    return 0;
}


Measured memory_bytes: 5492