#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repr(i,N) for(int i = (N) - 1; i >= 0; i--)
#define rep1(i,N) for(int i = 1; i <= (N) ; i++)
#define repr1(i,N) for(int i = (N) ; i > 0 ; i--)
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
using namespace std; void solve();
using ll = long long; using vl = vector<ll>;
using vi = vector<int>; using vvi = vector< vector<int> >;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0)
#else
  #define trc(...)
  #define trca(...)
  int main(){solve();}
#endif
using P = pair<ll,ll>; using vp = vector<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;
/////////

const double PI = acos(-1);
const double nya = 20.0 - 5.0 * PI;
const double tapi= 10 * PI - 20.0;

void solve(){

  #define x first
  #define y second
  P s,g; in(s , g);
  ini(N);
  vp v(N); in(v);
  if(s.x > g.x) swap(s , g);
  if(s.y > g.y){
    s.y *= -1 , g.y *= -1;
    each(p , v) p.y *= -1;
  }
 
  {
    vp a;
    each(p , v){
      if(s.x <= p.x && p.x <= g.x && s.y <= p.y && p.y <= g.y) a.pb(p);
    }
    v.swap(a);
  }
 
  if(s.x == g.x){
    int cnt = 0;
    each(p , v){
      if(p.x == s.x) cnt++;
    }
    die((g.y - s.y) * 100.0 + tapi * cnt);
  }
  if(s.y == g.y){
    int cnt = 0;
    each(p , v){
      if(s.y == p.y) cnt++;
    }
    die((g.x - s.x) * 100.0 + tapi * cnt);
  }
 
  sort(all(v));
  // 単調増加列
  vl dp;
  each(p , v){
    auto it = lower_bound(all(dp) , p.se);
    if(it == dp.end()) dp.pb(p.se);
    else *it = p.se;
  }
  trc(dp.size());
  int cnt = min( (ll)sz(dp) , min( g.y - s.y , g.x - s.x) );
  out( (g.x + g.y - s.x - s.y) * 100.0 - cnt * nya + (sz(dp) - cnt) * tapi);
 

}

Measured memory_bytes: 9584