Problem: One university has just found out about a sport programming contest called ACM ICPC v2.0. This contest doesn't differ much from the well-known ACM ICPC, for example, the participants are not allowed to take part in the finals more than two times. However, there is one notable difference: the teams in the contest should consist of exactly n participants.

Having taken part in several ACM ICPC v2.0 finals and having not won any medals, the students and the university governors realized that it's high time they changed something about the preparation process. Specifically, as the first innovation it was decided to change the teams' formation process. Having spent considerable amount of time on studying the statistics of other universities' performance, they managed to receive some interesting information: the dependence between the probability of winning a medal and the number of team members that participated in the finals in the past. More formally, we know n + 1 real numbers p0 ≤ p1 ≤ ... ≤ pn, where pi is the probability of getting a medal on the finals if the team has i participants of previous finals, and other n - i participants arrived to the finals for the first time.

Despite such useful data, the university governors are unable to determine such team forming tactics that would provide the maximum probability of winning a medal at ACM ICPC v2.0 finals on average (we are supposed to want to provide such result to the far future and we are also supposed to have an endless supply of students). And how about you, can you offer such optimal tactic? At the first stage the university governors want to know the value of maximum average probability.

More formally, suppose that the university sends a team to the k-th world finals. The team has ak participants of previous finals (0 ≤ ak ≤ n). Since each person can participate in the finals no more than twice, the following condition must be true: <image>. Your task is to choose sequence <image> so that the limit Ψ exists and it's value is maximal:

<image>

As <image> is an infinite sequence, you should only print the maximum value of the Ψ limit.

Input

The first line contains an integer n (3 ≤ n ≤ 100), n is the number of team participants. The second line contains n + 1 real numbers with no more than 6 digits after decimal point pi (0 ≤ i ≤ n, 0 ≤ pi ≤ 1) — the probability of that the team will win a medal if it contains i participants who has already been on the finals. Also the condition pi ≤ pi + 1 should be fulfilled for all 0 ≤ i ≤ n - 1.

Output

Print the only real number — the expected average number of medals won per year if the optimal strategy is used. The result may have absolute or relative error 10 - 6.

Examples

Input

3
0.115590 0.384031 0.443128 0.562356


Output

0.4286122500


Input

3
1 1 1 1


Output

0.9999999999

Note

In the second test, no matter what participants the team contains, it is doomed to be successful.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int sto = 103;
char c;
int n, tn;
long double best;
const double EPS = 1e-9;
namespace Simplex {
vector<vector<long double> > A;
vector<long double> b, c, res;
vector<int> kt, N;
int m;
inline void pivot(int k, int l, int e) {
  int x = kt[l];
  long double p = A[l][e];
  for (int i = 0; i < int(k); ++i) A[l][i] /= p;
  b[l] /= p;
  N[e] = 0;
  for (int i = 0; i < int(m); ++i)
    if (i != l) b[i] -= A[i][e] * b[l], A[i][x] = A[i][e] * -A[l][x];
  for (int j = 0; j < int(k); ++j)
    if (N[j]) {
      c[j] -= c[e] * A[l][j];
      for (int i = 0; i < int(m); ++i)
        if (i != l) A[i][j] -= A[i][e] * A[l][j];
    }
  kt[l] = e;
  N[x] = 1;
  c[x] = c[e] * -A[l][x];
}
vector<long double> doit(int k) {
  vector<long double> res;
  long double best;
  while (1) {
    int e = -1, l = -1;
    for (int i = 0; i < int(k); ++i)
      if (N[i] && c[i] > 1E-16) {
        e = i;
        break;
      }
    if (e == -1) break;
    for (int i = 0; i < int(m); ++i)
      if (A[i][e] > 1E-16 && (l == -1 || best > b[i] / A[i][e]))
        best = b[l = i] / A[i][e];
    if (l == -1) return vector<long double>();
    pivot(k, l, e);
  }
  res.resize(k, 0);
  for (int i = 0; i < int(m); ++i) res[kt[i]] = b[i];
  return res;
}
vector<long double> simplex(vector<vector<long double> > &AA,
                            vector<long double> &bb, vector<long double> &cc) {
  int n = AA[0].size(), k;
  m = AA.size();
  k = n + m + 1;
  kt.resize(m);
  b = bb;
  c = cc;
  c.resize(n + m);
  A = AA;
  for (int i = 0; i < int(m); ++i) {
    A[i].resize(k);
    A[i][n + i] = 1;
    A[i][k - 1] = -1;
    kt[i] = n + i;
  }
  N = vector<int>(k, 1);
  for (int i = 0; i < int(m); ++i) N[kt[i]] = 0;
  int pos = min_element(b.begin(), b.end()) - b.begin();
  if (b[pos] < -1E-16) {
    c = vector<long double>(k, 0);
    c[k - 1] = -1;
    pivot(k, pos, k - 1);
    res = doit(k);
    if (res[k - 1] > 1E-16) return vector<long double>();
    for (int i = 0; i < int(m); ++i)
      if (kt[i] == k - 1)
        for (int j = 0; j < int(k - 1); ++j)
          if (N[j] && (A[i][j] < -1E-16 || 1E-16 < A[i][j])) {
            pivot(k, i, j);
            break;
          }
    c = cc;
    c.resize(k, 0);
    for (int i = 0; i < int(m); ++i)
      for (int j = 0; j < int(k); ++j)
        if (N[j]) c[j] -= c[kt[i]] * A[i][j];
  }
  res = doit(k - 1);
  if (!res.empty()) res.resize(n);
  return res;
}
};  // namespace Simplex
int main() {
  scanf("%d", &n);
  vector<vector<long double> > a;
  a.resize(2);
  vector<long double> b, p;
  for (int i = 0; i <= (int)n; ++i) {
    long double x;
    cin >> x;
    p.push_back(x);
    a[0].push_back(1);
    a[1].push_back(i);
  }
  b.push_back(1);
  b.push_back((long double)n / 2);
  if (0) cout << "start" << endl;
  vector<long double> ans = Simplex::simplex(a, b, p);
  long double out = 0;
  for (int i = 0; i <= (int)n; ++i) {
    if (0) cout << ans[i] << endl;
    out += p[i] * ans[i];
  }
  cout << out;
  if (0) {
    scanf("%c", &c);
    scanf("%c", &c);
  }
  return 0;
}