Problem: Barney has finally found the one, a beautiful young lady named Lyanna. The problem is, Lyanna and Barney are trapped in Lord Loss' castle. This castle has shape of a convex polygon of n points. Like most of castles in Demonata worlds, this castle has no ceiling.

<image>

Barney and Lyanna have an escape plan, but it requires some geometry knowledge, so they asked for your help.

Barney knows that demons are organized and move in lines. He and Lyanna want to wait for the appropriate time so they need to watch for the demons. Each of them wants to stay in a point inside the castle (possibly on edges or corners), also they may stay in the same position. They both want to pick a real number r and watch all points in the circles with radius r around each of them (these two circles may overlap).

<image>

We say that Barney and Lyanna are watching carefully if and only if for every edge of the polygon, at least one of them can see at least one point on the line this edge lies on, thus such point may not be on the edge but it should be on edge's line. Formally, each edge line should have at least one common point with at least one of two circles.

The greater r is, the more energy and focus they need. So they asked you to tell them the minimum value of r such that they can watch carefully.

Input

The first line of input contains a single integer n (3 ≤ n ≤ 300) — the number of castle polygon vertices.

The next n lines describe the polygon vertices in counter-clockwise order. i-th of them contains two integers xi and yi (|xi|, |yi| ≤ 104) — the coordinates of i-th point of the castle. It is guaranteed that given points form a convex polygon, in particular, any three of them do not line on the same line.

Output

In the first line print the single number r — minimum radius of guys' watching circles.

In the second line print the pair of coordinates of point where Barney should stay.

In the third line print the pair of coordinates of point where Lyanna should stay.

Points should lie inside the polygon.

Coordinates may not be integers. If there are multiple answers print any of them.

Your answer will be considered correct if its absolute or relative error doesn't exceed 10 - 6.

Examples

Input

4
-41 67
-16 20
25 25
-36 85


Output

0
-16 20
-36 85


Input

7
-7 54
-5 31
-2 17
20 19
32 23
34 27
26 57


Output

2.9342248
32.019503 23.0390067
-6.929116 54.006444

Note

In the first example guys can stay in opposite corners of the castle.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int nax = 1005;
struct P {
  double x, y;
  void read() { scanf("%lf%lf", &x, &y); }
  void write() { printf("%.10lf %.10lf\n", x, y); }
  P operator-(P other) { return P{x - other.x, y - other.y}; }
  double operator*(P other) { return x * other.y - y * other.x; }
  double norm() { return sqrt(x * x + y * y); }
};
P mean(P a, P b) { return P{(a.x + b.x) / 2, (a.y + b.y) / 2}; }
int n;
P t[nax];
P vec[nax];
double distLine(int i, P A) {
  return abs((vec[i] * (A - t[i])) / vec[i].norm());
}
bool possible[nax][nax];
P best_point[nax][nax];
double best_r[nax][nax];
int main() {
  scanf("%d", &n);
  for (int i = (0); i <= ((n)-1); ++i) t[i].read();
  for (int i = (0); i <= ((2 * n) - 1); ++i) t[n + i] = t[i];
  for (int i = (0); i <= ((3 * n) - 1); ++i) vec[i] = t[i + 1] - t[i];
  for (int start = (0); start <= ((n)-1); ++start) {
    int whereMid = start;
    for (int end = start; start == end || vec[start] * vec[end] > 0.5; ++end) {
      assert(end < start + n);
      while (whereMid < end &&
             distLine(start, t[whereMid + 1]) < distLine(end, t[whereMid + 1]))
        ++whereMid;
      P low = t[whereMid], high = t[whereMid + 1];
      for (int _ = (0); _ <= ((42) - 1); ++_) {
        P mid = mean(low, high);
        if (distLine(start, mid) < distLine(end, mid))
          low = mid;
        else
          high = mid;
      }
      P mid = mean(low, high);
      best_point[start][end % n] = mid;
      best_r[start][end % n] = max(distLine(start, mid), distLine(end, mid));
      possible[start][end % n] = true;
    }
  }
  double r = 1e7;
  P a, b;
  for (int start = (0); start <= ((n)-1); ++start)
    for (int end = (0); end <= ((n)-1); ++end) {
      int start2 = (end + 1) % n;
      int end2 = (start + n - 1) % n;
      if (possible[start][end] && possible[start2][end2]) {
        double maybe = max(best_r[start][end], best_r[start2][end2]);
        if (maybe < r) {
          r = maybe;
          a = best_point[start][end];
          b = best_point[start2][end2];
        }
      }
    }
  printf("%.10lf\n", r);
  a.write();
  b.write();
  return 0;
}