Problem: Gerald got tired of playing board games with the usual six-sided die, and he bought a toy called Randomizer. It functions as follows.

A Randomizer has its own coordinate plane on which a strictly convex polygon is painted, the polygon is called a basic polygon. If you shake a Randomizer, it draws some nondegenerate (i.e. having a non-zero area) convex polygon with vertices at some vertices of the basic polygon. The result of the roll (more precisely, the result of the shaking) is considered to be the number of points with integer coordinates, which were strictly inside (the points on the border are not considered) the selected polygon. Now Gerald is wondering: what is the expected result of shaking the Randomizer?

During the shaking the Randomizer considers all the possible non-degenerate convex polygons with vertices at the vertices of the basic polygon. Let's assume that there are k versions of the polygons. Then the Randomizer chooses each of them with probability <image>.

Input

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

Next n lines contain the coordinates of the vertices of the basic polygon. The i-th of these lines contain two integers xi and yi ( - 109 ≤ xi, yi ≤ 109) — the coordinates of the i-th vertex of the polygon. The vertices are given in the counter-clockwise order.

Output

Print the sought expected value with absolute or relative error at most 10 - 9.

Examples

Input

4
0 0
2 0
2 2
0 2


Output

0.2


Input

5
0 0
2 0
2 2
1 3
0 2


Output

0.8125

Note

A polygon is called strictly convex if it is convex and no its vertices lie on the same line.

Let's assume that a random variable takes values x1, ..., xn with probabilities p1, ..., pn, correspondingly. Then the expected value of this variable equals to <image>.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 200200, D = 50;
int i, j, k, n, m, ch, ff;
long long sum;
double T, ans, tm2[N], tm2_[N];
struct point {
  int x, y;
} t, A[N];
void R(int &x) {
  ff = x = 0;
  ch = getchar();
  while (ch < '0' || '9' < ch) {
    if (ch == '-') ff = 1;
    ch = getchar();
  }
  while ('0' <= ch && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  if (ff) x = -x;
}
int gcd(int a, int b) {
  if (!b) return a;
  return gcd(b, a % b);
}
int ab(const int &x) {
  if (x < 0) return -x;
  return x;
}
long long Js(const point &a, const point &b, const point &c) {
  int x1 = b.x - a.x, y1 = b.y - a.y;
  int x2 = c.x - b.x, y2 = c.y - b.y;
  return (long long)x1 * y2 - (long long)x2 * y1;
}
void pre(int n) {
  int i;
  tm2[0] = tm2_[0] = 1.0;
  for (i = 1; i <= n; i++) tm2[i] = 2.0 * tm2[i - 1];
  for (i = 1; i <= n; i++) tm2_[i] = 0.5 * tm2_[i - 1];
}
int main() {
  R(n);
  pre(n);
  if (n <= D) {
    T = tm2[n] - 1.0 * (1 + n + n * (n - 1) / 2);
    for (i = 1; i <= n; i++) R(A[i].x), R(A[i].y);
    for (i = 1; i <= n; i++) A[n + i] = A[i];
    sum = 2;
    for (i = 1; i <= n; i++) {
      sum += Js(t, A[i], A[i + 1]);
      sum -= gcd(ab(A[i + 1].x - A[i].x), ab(A[i + 1].y - A[i].y));
    }
    ans = 0.5 * sum;
    for (i = 1; i <= n; i++) {
      sum = 2;
      for (j = i + 1; j < i + n; j++) {
        sum += Js(t, A[j - 1], A[j]);
        sum -= gcd(ab(A[j].x - A[j - 1].x), ab(A[j].y - A[j - 1].y));
        if (j == i + 1 || j == i + n - 1) continue;
        int tt = gcd(ab(A[i].x - A[j].x), ab(A[i].y - A[j].y));
        long long tmp = sum + Js(t, A[j], A[i]) - tt;
        double Tmp = 0.5 * tmp + tt - 1;
        ans -= (tm2[n - (j - i + 1)] - 1.0) / T * Tmp;
      }
    }
    printf("%.10lf\n", ans);
    return 0;
  }
  for (i = 1; i <= n; i++) R(A[i].x), R(A[i].y);
  for (i = 1; i <= n; i++) A[n + i] = A[i];
  sum += 2;
  for (i = 1; i <= n; i++) {
    sum += Js(t, A[i], A[i + 1]);
    sum -= gcd(ab(A[i + 1].x - A[i].x), ab(A[i + 1].y - A[i].y));
  }
  ans = 0.5 * sum;
  for (i = 1; i <= n; i++) {
    sum = 2;
    for (j = i + 1; j < i + D; j++) {
      sum += Js(t, A[j - 1], A[j]);
      sum -= gcd(ab(A[j].x - A[j - 1].x), ab(A[j].y - A[j - 1].y));
      if (j == i + 1 || j == i + n - 1) continue;
      int tt = gcd(ab(A[i].x - A[j].x), ab(A[i].y - A[j].y));
      long long tmp = sum + Js(t, A[j], A[i]) - tt;
      double Tmp = 0.5 * tmp + tt - 1;
      ans -= tm2_[j - i + 1] * Tmp;
    }
  }
  printf("%.10lf\n", ans);
}