// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 2e5 + 5;
const long double PI = acosl(-1);

Pii S, T;
int N;
Pii A[MAXN];

void input()
{
    read(S.x); read(S.y); read(T.x); read(T.y);
    read(N);
    for (int i = 1; i <= N; ++i) {
        read(A[i].x); read(A[i].y);
    }
}

void solve()
{
    if (S > T)
        std::swap(S, T);
    if (S.y > T.y) {
        for (int i = 1; i <= N; ++i) {
            A[i].y = S.y - A[i].y;
        }
        T.y = S.y - T.y;
        S.y = 0;
    }

    assert(S.x <= T.x);
    assert(S.y <= T.y);

    vector<Pii> list;

    for (int i = 1; i <= N; ++i) {
        if (S.x <= A[i].x && A[i].x <= T.x && S.y <= A[i].y && A[i].y <= T.y)
            list.push_back(A[i]);
    }
    std::sort(ALL(list));

    static int g[MAXN];

    int max = 0;
    memset(g, +oo, sizeof(g));
    g[0] = -oo;
    for (int i = 0; i < SZ(list); ++i) {
        int x = list[i].y;
        int t = std::lower_bound(g, g + i + 1, x) - g;
        g[t] = x;
        chkmax(max, t);
    }

    long double fq = 2 * PI * 10 * 0.25 - 20;
    long double yj = 2 * PI * 10 * 0.50 - 20;
    long double ans = 100.0 * (T.x - S.x + T.y - S.y) + max * fq + (max == std::min(T.x - S.x, T.y - S.y) + 1) * (yj - fq);
    printf("%.15Lf\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("C.in", "r", stdin);
    freopen("C.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 人生若只如初见，何事秋风悲画扇。


Measured memory_bytes: 4336