Problem: You have got a new job, and it's very interesting, you are a ship captain. Your first task is to move your ship from one point to another point, and for sure you want to move it at the minimum cost.

And it's well known that the shortest distance between any 2 points is the length of the line segment between these 2 points. But unfortunately there is an island in the sea, so sometimes you won't be able to move your ship in the line segment between the 2 points.

You can only move to safe points. A point is called safe if it's on the line segment between the start and end points, or if it's on the island's edge.

But you are too lucky, you have got some clever and strong workers and they can help you in your trip, they can help you move the ship in the sea and they will take 1 Egyptian pound for each moving unit in the sea, and they can carry the ship (yes, they are very strong) and walk on the island and they will take 2 Egyptian pounds for each moving unit in the island. The money which you will give to them will be divided between all workers, so the number of workers does not matter here.

You can move your ship on the island edge, and it will be considered moving in the sea.

Now you have a sea map, and you have to decide what is the minimum cost for your trip.

Your starting point is (xStart, yStart), and the end point is (xEnd, yEnd), both points will be different.

The island will be a convex polygon and there will be no more than 2 polygon points on the same line, also the starting and the end points won't be inside or on the boundary of the island. The points for the polygon will be given in the anti-clockwise order.

Input

The first line contains 4 integers, xStart, yStart, xEnd and yEnd ( - 100 ≤ xStart, yStart, xEnd, yEnd ≤ 100). The second line contains an integer n, which is the number of points in the polygon (3 ≤ n ≤ 30), followed by a line containing n pairs of integers x and y, which are the coordinates of the points ( - 100 ≤ x, y ≤ 100), the polygon points will be distinct.

Output

Print one line which contains the minimum possible cost. The absolute or relative error in the answer should not exceed 10 - 6.

Examples

Input

1 7 6 7
4
4 2 4 12 3 12 3 2


Output

6.000000000


Input

-1 0 2 0
4
0 0 1 0 1 1 0 1


Output

3.000000000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
int sgn(double d) { return d > eps ? 1 : (d < -eps ? -1 : 0); }
struct point {
  double x, y;
  point(double _x = 0, double _y = 0) : x(_x), y(_y) {}
  void input() { scanf("%lf%lf", &x, &y); }
  double len() const { return sqrt(x * x + y * y); }
};
point operator+(const point& p1, const point& p2) {
  return point(p1.x + p2.x, p1.y + p2.y);
}
point operator-(const point& p1, const point& p2) {
  return point(p1.x - p2.x, p1.y - p2.y);
}
double operator^(const point& p1, const point& p2) {
  return p1.x * p2.x + p1.y * p2.y;
}
double operator*(const point& p1, const point& p2) {
  return p1.x * p2.y - p1.y * p2.x;
}
const int max_n = 30 + 5;
int n;
point src, dst, pol[max_n];
void solve();
double get_min_cost();
bool get_intersection(const point&, const point&, const point&, const point&,
                      point&);
double get_cost(int, int, const point&, const point&);
int main() {
  solve();
  return 0;
}
void solve() {
  src.input();
  dst.input();
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) pol[i].input();
  printf("%.8lf\n", get_min_cost());
}
double get_min_cost() {
  vector<pair<int, point> > vec;
  pol[n] = pol[0];
  for (int i = 0; i < n; ++i) {
    point c;
    if (get_intersection(src, dst, pol[i], pol[i + 1], c))
      vec.push_back(make_pair(i, c));
  }
  if (vec.size() != 2) return (dst - src).len();
  if (sgn((vec[0].second - src) ^ (vec[0].second - vec[1].second)) > 0)
    swap(vec[0], vec[1]);
  double tmp = (vec[1].second - vec[0].second).len() * 2.0;
  double tmp1 =
      get_cost(vec[0].first, vec[1].first, vec[0].second, vec[1].second);
  double tmp2 =
      get_cost(vec[1].first, vec[0].first, vec[1].second, vec[0].second);
  double cost = (vec[0].second - src).len() + (vec[1].second - dst).len() +
                min(tmp, min(tmp1, tmp2));
  return cost;
}
bool get_intersection(const point& p1, const point& p2, const point& p3,
                      const point& p4, point& c) {
  double d1 = (p2 - p1) * (p3 - p1), d2 = (p2 - p1) * (p4 - p1);
  double d3 = (p4 - p3) * (p1 - p3), d4 = (p4 - p3) * (p2 - p3);
  int s1 = sgn(d1), s2 = sgn(d2), s3 = sgn(d3), s4 = sgn(d4);
  if (s2 == 0) return false;
  c = point((p3.x * d2 - p4.x * d1) / (d2 - d1),
            (p3.y * d2 - p4.y * d1) / (d2 - d1));
  return s1 * s2 <= 0 && s3 * s4 <= 0;
}
double get_cost(int id1, int id2, const point& p1, const point& p2) {
  double cost = (pol[id1 + 1] - p1).len() + (pol[id2] - p2).len();
  for (int i = (id1 + 1) % n; i != id2; i = (i + 1) % n)
    cost += (pol[i + 1] - pol[i]).len();
  return cost;
}