#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',')cerr<<*sdbg++; cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

const int M = 1 << 20;
int drz[2 * M + 5];
int Read(int a, int b) {
  a += M;
  b += M;
  int res = max(drz[a], drz[b]);
  while (a / 2 != b / 2) {
    if (a % 2 == 0) {
      maxi(res, drz[a + 1]);
    }
    if (b % 2 == 1) {
      maxi(res, drz[b - 1]);
    }
    a /= 2;
    b /= 2;
  }
  return res;
}
void Upd(int a, int v) {
  a += M;
  while (a) {
    maxi(drz[a], v);
    a /= 2;
  }
}
    
int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(20);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  
  int n;
  int x1, y1, x2, y2;
  cin>>x1>>y1>>x2>>y2;
  if (x1 > x2) {
    swap(x1, x2);
    swap(y1, y2);
  }
  int R = 1e8;
  int swy = 0;
  if (y1 > y2) {
    swy = 1;
    y1 = R - y1;
    y2 = R - y2;
  }
  cin>>n;
  map<int, int> mapuj;
  VPII fonts;
  RE (i, n) {
    int x, y;
    cin>>x>>y;
    if (swy) {
      y = R - y;
    }
    if (x1 <= x && x <= x2 && y1 <= y && y <= y2) {
      fonts.PB({x, y});
      mapuj[y] = 1;
    }
  }
  int nxt = 1;
  for (auto& p : mapuj) {
    p.nd = nxt;
    nxt++;
  }
  for (auto& f : fonts) {
    f.nd = mapuj[f.nd];
  }
  sort(ALL(fonts));
  int res = 0;
  for (auto f : fonts) {
    int at_me = 1 + Read(1, f.nd);
    maxi(res, at_me);
    Upd(f.nd, at_me);
  }
  const LD kPi = 2 * acos(0);
  LD profit = 20 - 5 * kPi;
  LD loss = 10 * kPi - 20;
  int heh = min(x2 - x1, y2 - y1);
  LD base = 100 * (x2 - x1 + y2 - y1);
  if (res == heh + 1) {
    cout<<base - (res - 1) * profit + loss<<endl;
  } else {
    cout<<base - res * profit<<endl;
  }
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}


Measured memory_bytes: 23404