#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
typedef vector<vector<ll>> mat;
typedef vector<int> vec;

struct SegT {
private:
	int sz; vector<int> node;
	const int init_c = 0;
public:
	SegT(int n) {
		sz = 1;
		while (sz < n)sz *= 2;
		node.resize(2 * sz - 1, init_c);
	}
	int f(int a, int b) {
		return max(a, b);
	}
	void update(int k, ld a) {
		k += sz - 1;
		node[k] = a;
		while (k > 0) {
			k = (k - 1) / 2;
			node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	int query(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = sz;
		if (r <= a || b <= l)return init_c;
		else if (a <= l && r <= b)return node[k];
		else {
			int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
			int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
			return f(vl, vr);
		}
	}
};

bool comp(P a, P b) {
	if (a.second != b.second)return a.second < b.second;
	return a.first < b.first;
}

void solve() {
	int sx[2], sy[2];
	rep(i, 2)cin >> sx[i] >> sy[i];
	if (sy[0] > sy[1]) {
		swap(sx[0], sx[1]);
		swap(sy[0], sy[1]);
	}
	bool rx = false;
	if (sx[0] > sx[1]) {
		rx = true;
		rep(i, 2)sx[i] = -sx[i];
	}
	ld add = 0;
	add += sx[1] - sx[0];
	add += sy[1] - sy[0];
	add *= 100;
	vector<int> vx, vy;
	vector<P> al;
	rep(i, 2) {
		vx.push_back(sx[i]);
		vy.push_back(sy[i]);
	}
	ld c1 =5*pi-20;
	ld c2 = 10 * pi - 20;
	int n; cin >> n;
	rep(i, n) {
		int x, y; cin >> x >> y;
		if (rx)x = -x;
		if (y<sy[0] || y>sy[1])continue;
		if (x<sx[0] || x>sx[1])continue;
		vx.push_back(x);
		vy.push_back(y);
		al.push_back({ x,y });
	}
	sort(vx.begin(), vx.end());
	vx.erase(unique(vx.begin(), vx.end()), vx.end());
	map<int, int> mpx, mpy;
	sort(vy.begin(), vy.end());
	vy.erase(unique(vy.begin(), vy.end()), vy.end());
	rep(i, vx.size())mpx[vx[i]] = i;
	rep(i, vy.size())mpy[vy[i]] = i;
	rep(i, 2) {
		sx[i] = mpx[sx[i]];
		sy[i] = mpy[sy[i]];
	}
	rep(i, al.size()) {
		int &x = al[i].first, &y = al[i].second;
		x = mpx[x];
		y = mpy[y];
	}
	sort(al.begin(), al.end(),comp);
	SegT st(vx.size());
	st.update(0, 0);
	rep(i, al.size()) {
		int x = al[i].first;
		int val = st.query(0, x);
		st.update(x, val + 1);
	}
	int num = st.query(0, vx.size());
	int dif = min(vx[sx[1]] - vx[sx[0]], vy[sy[1]] - vy[sy[0]]) + 1;
	if (dif == num) {
		cout << add + (num - 1)*c1 + c2 << endl;
	}
	else {
		cout << add + num * c1 << endl;
	}
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(12);
	//init();
	solve();
	//stop
	return 0;
}

Measured memory_bytes: 24156