Problem: You are playing a game and your goal is to maximize your expected gain. At the beginning of the game, a pawn is put, uniformly at random, at a position p\in\\{1,2,\dots, N\\}. The N positions are arranged on a circle (so that 1 is between N and 2).

The game consists of turns. At each turn you can either end the game, and get A_p dollars (where p is the current position of the pawn), or pay B_p dollar to keep playing. If you decide to keep playing, the pawn is randomly moved to one of the two adjacent positions p-1, p+1 (with the identifications 0 = N and N+1=1).

What is the expected gain of an optimal strategy?

Note: The "expected gain of an optimal strategy" shall be defined as the supremum of the expected gain among all strategies such that the game ends in a finite number of turns.

Constraints

* 2 \le N \le 200,000
* 0 \le A_p \le 10^{12} for any p = 1,\ldots, N
* 0 \le B_p \le 100 for any p = 1, \ldots, N
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
A_1 A_2 \cdots A_N
B_1 B_2 \cdots B_N


Output

Print a single real number, the expected gain of an optimal strategy. Your answer will be considered correct if its relative or absolute error does not exceed 10^{-10}.

Examples

Input

5
4 2 6 3 5
1 1 1 1 1


Output

4.700000000000


Input

4
100 0 100 0
0 100 0 100


Output

50.000000000000


Input

14
4839 5400 6231 5800 6001 5200 6350 7133 7986 8012 7537 7013 6477 5912
34 54 61 32 52 61 21 43 65 12 45 21 1 4


Output

7047.142857142857


Input

10
470606482521 533212137322 116718867454 746976621474 457112271419 815899162072 641324977314 88281100571 9231169966 455007126951
26 83 30 59 100 88 84 91 54 61


Output

815899161079.400024414062

Solution (in CPP):

Solution:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <queue>
#include <set>
using namespace std;

#define FOR(i,n) for (int i = 0; i < n; i++)

double ecost[222222];
double cost[222222];
double bee[222222];
int n;
struct Edge {
  int to;
  double prob, cost;
};
vector<Edge> neigh[222222];
int deleted[222222];
vector<int> deleted_nodes;

void delete_node(int v) {
  int u = neigh[v][0].to;
  int w = neigh[v][1].to;
  int uv = 0, wv = 0;
  if (neigh[u][uv].to != v) uv++;
  if (neigh[w][wv].to != v) wv++;
  double pvu = neigh[v][0].prob;
  double cvu = neigh[v][0].cost;
  double pvw = neigh[v][1].prob;
  double cvw = neigh[v][1].cost;
  double &puv = neigh[u][uv].prob;
  double &cuv = neigh[u][uv].cost;
  double &put = neigh[u][!uv].prob;
  double &cut = neigh[u][!uv].cost;
  double &pwv = neigh[w][wv].prob;
  double &cwv = neigh[w][wv].cost;
  double &pwx = neigh[w][!wv].prob;
  double &cwx = neigh[w][!wv].cost;

  double puu = puv*pvu, cuu = cuv+cvu;
  double puw = puv*pvw, cuw = cuv+cvw;
  double pww = pwv*pvw, cww = cwv+cvw;
  double pwu = pwv*pvu, cwu = cwv+cvu;
  double newput = put / (put + puw), newcut = cut +       puu*cuu/(1-puu)/(1-puu) * (put+puw);
  double newpuw = puw / (put + puw), newcuw = cuv + cvw + puu*cuu/(1-puu)/(1-puu) * (put+puw);
  double newpwx = pwx / (pwx + pwu), newcwx = cwx +       pww*cww/(1-pww)/(1-pww) * (pwx+pwu);
  double newpwu = pwu / (pwx + pwu), newcwu = cwv + cvu + pww*cww/(1-pww)/(1-pww) * (pwx+pwu);
  neigh[u][uv].to = w; neigh[w][wv].to = u;
  put = newput; cut = newcut;
  puv = newpuw; cuv = newcuw;
  pwv = newpwu; cwv = newcwu;
  pwx = newpwx; cwx = newcwx;
}

void calc_ecost() {
  FOR(i,n) if (!deleted[i]) ecost[i] = cost[i]; else ecost[i] = -1e40;
  for (int i = (int)deleted_nodes.size()-1; i >= 0; i--) {
    int v = deleted_nodes[i];
    ecost[v] = 0;
    for (auto e : neigh[v]) {
      ecost[v] += e.prob * (e.cost + ecost[e.to]);
    }
  }
  FOR(i,n) {
    double shouldcost = cost[i];
    if (deleted[i]) shouldcost = -bee[i] + (ecost[(n+i-1)%n] + ecost[(i+1)%n]) * .5;
    if (fabs(shouldcost - ecost[i]) > 1e-8 && fabs(shouldcost/ecost[i] - 1) > 1e-8) {
      printf("%i should cost %g; does cost %g\n", i, shouldcost, ecost[i]);
    }
  }
}

int main() {
  scanf("%i", &n);
  FOR(i,n) scanf("%lf", cost+i);
  FOR(i,n) scanf("%lf", bee+i);
  FOR(i,n) {
    neigh[i].push_back(Edge{(i+1)%n, .5, -bee[i]});
    neigh[i].push_back(Edge{(n+i-1)%n, .5, -bee[i]});
  }
  queue<int> q;
  FOR(i,n) q.push(i);
  while (q.size()) {
    int x = q.front(); q.pop();
    if (deleted[x]) continue;
    double here = 0;
    for (auto e : neigh[x]) {
      here += e.prob * (e.cost + cost[e.to]);
    }
    if (here > cost[x]) {
      for (auto p : neigh[x]) q.push(p.to);
      delete_node(x);
      deleted[x] = 1;
      deleted_nodes.push_back(x);

      #if 0
      printf("set policy for %i to passthrough\n", x);
      calc_ecost();
      FOR(i,n) printf("%g ", ecost[i]);
      printf("\n");
      FOR(i,n) {
        printf("node %i cost %f bee %f", i, cost[i], bee[i]);
        for (auto e : neigh[i]) printf(" (to %i prob %g cost %g)", e.to, e.prob, e.cost);
        printf("\n");
      }
      #endif
    }
  }
  calc_ecost();
  double ans = 0;
  FOR(i,n) ans += ecost[i];
  ans /= n;
  printf("%.12f\n", ans);
}