Problem: A prisoner wants to escape from a prison. The prison is represented by the interior of the convex polygon with vertices P_1, P_2, P_3, …, P_{n+1}, P_{n+2}, P_{n+3}. It holds P_1=(0,0), P_{n+1}=(0, h), P_{n+2}=(-10^{18}, h) and P_{n+3}=(-10^{18}, 0).

<image>

The prison walls P_{n+1}P_{n+2}, P_{n+2}P_{n+3} and P_{n+3}P_1 are very high and the prisoner is not able to climb them. Hence his only chance is to reach a point on one of the walls P_1P_2, P_2P_3,..., P_{n}P_{n+1} and escape from there. On the perimeter of the prison, there are two guards. The prisoner moves at speed 1 while the guards move, remaining always on the perimeter of the prison, with speed v.

If the prisoner reaches a point of the perimeter where there is a guard, the guard kills the prisoner. If the prisoner reaches a point of the part of the perimeter he is able to climb and there is no guard there, he escapes immediately. Initially the prisoner is at the point (-10^{17}, h/2) and the guards are at P_1. 

Find the minimum speed v such that the guards can guarantee that the prisoner will not escape (assuming that both the prisoner and the guards move optimally).

Notes:

  * At any moment, the guards and the prisoner can see each other. 
  * The "climbing part" of the escape takes no time. 
  * You may assume that both the prisoner and the guards can change direction and velocity instantly and that they both have perfect reflexes (so they can react instantly to whatever the other one is doing). 
  * The two guards can plan ahead how to react to the prisoner movements. 

Input

The first line of the input contains n (1 ≤ n ≤ 50).

The following n+1 lines describe P_1, P_2,..., P_{n+1}. The i-th of such lines contain two integers x_i, y_i (0≤ x_i, y_i≤ 1,000) — the coordinates of P_i=(x_i, y_i).

It is guaranteed that P_1=(0,0) and x_{n+1}=0. The polygon with vertices P_1,P_2,..., P_{n+1}, P_{n+2}, P_{n+3} (where P_{n+2}, P_{n+3} shall be constructed as described in the statement) is guaranteed to be convex and such that there is no line containing three of its vertices.

Output

Print a single real number, the minimum speed v that allows the guards to guarantee that the prisoner will not escape. Your answer will be considered correct if its relative or absolute error does not exceed 10^{-6}.

Examples

Input


2
0 0
223 464
0 749


Output


1


Input


3
0 0
2 2
2 4
0 6


Output


1.0823922


Input


4
0 0
7 3
7 4
5 7
0 8


Output


1.130309669


Input


5
0 0
562 248
460 610
281 702
206 723
0 746


Output


1.148649561


Input


7
0 0
412 36
745 180
747 184
746 268
611 359
213 441
0 450


Output


1.134745994

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct Point {
  double x, y;
  Point() { x = y = 0; }
  Point(double _x, double _y) { x = _x, y = _y; }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator/(double c) { return Point(x / c, y / c); }
} P[55];
double operator*(Point A, Point B) { return A.x * B.x + A.y * B.y; }
double Length(Point A) { return sqrt(A * A); }
void Check2(double a, double b, double c, double l, double r,
            vector<pair<double, double> > &ans) {
  if (a > 0) {
    b /= a, c /= a, a = 1;
    if (b * b < 4 * a * c) return;
    double d = sqrt(b * b - 4 * a * c);
    double l0 = (-b - d) / (2 * a), r0 = (-b + d) / (2 * a);
    l0 = max(l0, l), r0 = min(r0, r);
    if (l0 < r0) ans.push_back(make_pair(l0, r0));
    return;
  }
  if (a < 0) {
    double s = sqrt(a * a + b * b + c * c);
    a /= s, b /= s, c /= s;
    if (b * b < 4 * a * c) {
      ans.push_back(make_pair(l, r));
      return;
    }
    double d = sqrt(b * b - 4 * a * c);
    double l0 = (-b + d) / (2 * a), r0 = (-b - d) / (2 * a);
    if (a > -0.01) {
      if (b > 0)
        l0 = (-2 * c) / (b + d);
      else
        r0 = (2 * c) / (-b + d);
    }
    if (l < l0) ans.push_back(make_pair(l, min(l0, r)));
    if (r0 < r) ans.push_back(make_pair(max(l, r0), r));
  }
}
void Check1(double a, double b, double c, double d, double l0, double r0,
            double l1, double r1, vector<pair<double, double> > &ans) {
  double lmin = (-2 * r1 - c) / a, rmin = (-2 * l1 - c) / a;
  lmin = max(lmin, l0), rmin = min(rmin, r0);
  if (lmin < rmin)
    Check2(1 - a * a / 4, b - a * c / 2, d - c * c / 4, lmin, rmin, ans);
  Check2(1, a * l1 + b, l1 * l1 + c * l1 + d, l0, r0, ans);
  Check2(1, a * r1 + b, r1 * r1 + c * r1 + d, l0, r0, ans);
}
void Find(Point A, Point B, Point C, Point D, double v, double l,
          vector<pair<double, double> > &ans) {
  double lA = 0, rA = Length(B - A), lC = 0, rC = Length(D - C);
  Point dA = (B - A) / rA, dC = (D - C) / rC;
  if (v >= sqrt(2 / (1 + dA * dC))) return;
  double c1 = v * v - 1;
  double c2 = (2 * (1 - (v * v) * (dA * dC))) / c1;
  double c3 = (2 * v * v * ((A - C) * dA) + 2 * l) / c1;
  double c4 = (-2 * v * v * ((A - C) * dC) - 2 * l) / c1;
  double c5 = (v * v * ((A - C) * (A - C)) - l * l) / c1;
  Check1(c2, c3, c4, c5, lA, rA, lC, rC, ans);
}
bool Check(pair<double, double> I1, pair<double, double> I2) {
  return max(I1.first, I2.first) < min(I1.second, I2.second);
}
double pre[55];
int n, T = 50;
int main() {
  scanf("%d", &n);
  for (int i = 0; i <= n; i++) scanf("%lf%lf", &P[i].x, &P[i].y);
  for (int i = 1; i < n; i++) pre[i] = pre[i - 1] + Length(P[i] - P[i - 1]);
  if (n <= 2) {
    puts("1");
    return 0;
  }
  double l = 1.0, r = 30.0;
  while (T--) {
    bool flg = 0;
    double mid = (l + r) / 2;
    for (int i = 1; i < n - 1; i++) {
      vector<pair<double, double> > A, B;
      for (int j = 0; j < i; j++)
        Find(P[i], P[i + 1], P[j], P[j + 1], mid, pre[j] - pre[i], A);
      for (int j = i + 1; j < n; j++)
        Find(P[i], P[i + 1], P[j], P[j + 1], mid, pre[j] - pre[i], B);
      for (int j = 0; j < (int)A.size(); j++)
        for (int k = 0; k < (int)B.size(); k++) flg |= Check(A[j], B[k]);
    }
    if (flg)
      l = mid;
    else
      r = mid;
  }
  printf("%.10lf\n", l);
}