Problem: The night after the graduation ceremony graduate students of German University in Cairo (GUC) are playing darts. As there's no real dart board available, the photographs of members of the GUC upper management are being used.

So, n rectangular photos are placed on the wall. They can overlap arbitrary and even coincide. The photos are not necessarily placed horizontally or vertically, they could also be rotated before being pinned to the wall.

The score of one dart throw is simply the number of photos the dart went through.

Fatma has made a throw but her score was not recorded. She only remembers that she did make it into at least one photo.

Assuming that the probability distribution of the throw is equal across the whole wall, what would be the expectation of Fatma's score?

Input

The first line of input contains integer n (1 ≤ n ≤ 500) — the number of photos on the wall. Then follow n lines describing the photos, each containing 8 single-space-separated integers (coordinates of 4 vertices): x1, y1, x2, y2, x3, y3, x4, y4. Each photo is a rectangle with a nonzero area. The coordinates are integers, not exceeding 104 by absolute value. The coordinates of the rectangle are given in either clockwise or counterclockwise order.

Output

Print the expected score of the throw. The answer will be accepted if it has absolute or relative error not exceeding 10 - 6.

Examples

Input

1
0 0 0 2 2 2 2 0


Output

1.0000000000


Input

1
-1 0 0 1 1 0 0 -1


Output

1.0000000000


Input

4
0 0 0 1 3 1 3 0
0 0 0 3 1 3 1 0
3 3 2 3 2 0 3 0
3 3 3 2 0 2 0 3


Output

1.5000000000


Input

2
-1 0 0 1 1 0 0 -1
0 0 1 1 2 0 1 -1


Output

1.1428571429

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
namespace acm {
const int N = 510;
const int M = 6;
const double eps = 1e-8;
int dcmp(double x) {
  if (x < -eps)
    return -1;
  else
    return x > eps;
}
struct cpoint {
  double x, y;
  cpoint() {}
  cpoint(double x, double y) : x(x), y(y) {}
  cpoint operator+(const cpoint& u) const { return cpoint(x + u.x, y + u.y); }
  cpoint operator-(const cpoint& u) const { return cpoint(x - u.x, y - u.y); }
  cpoint operator*(const double& s) const { return cpoint(x * s, y * s); }
  cpoint operator/(const double& s) const { return cpoint(x / s, y / s); }
  double operator*(const cpoint& u) const { return x * u.y - y * u.x; }
  double operator^(const cpoint& u) const { return x * u.x + y * u.y; }
  bool operator==(const cpoint& u) const {
    return dcmp(x - u.x) == 0 && dcmp(y - u.y) == 0;
  }
  bool operator<(const cpoint& u) const {
    if (dcmp(x - u.x))
      return x < u.x;
    else
      return dcmp(y - u.y) < 0;
  }
  void get() { scanf("%lf%lf", &x, &y); }
};
struct poly {
  int n;
  cpoint cp[M];
  void get() {
    n = 4;
    for (int i = 0; i < (int)(n); ++i) cp[i].get();
  }
  bool check() {
    cp[n] = cp[0];
    double area = 0;
    for (int i = 0; i < (int)(n); ++i) area += cp[i] * cp[i + 1];
    if (dcmp(area) == 0) return false;
    if (area < 0) reverse(cp, cp + n);
    cp[n] = cp[0];
    return true;
  }
} ply[N];
int n;
pair<cpoint, cpoint> seg1[N * M], seg2[N * M];
cpoint lin[N * M];
cpoint getline(cpoint u, cpoint v) {
  double k;
  if (dcmp(u.x - v.x) == 0)
    k = 1e200;
  else
    k = (u.y - v.y) / (u.x - v.x);
  return cpoint(k, u.y - k * u.x);
}
bool getcut(cpoint lin, cpoint a, cpoint b, cpoint& cp) {
  double t = lin.x * (a.x - b.x) - (a.y - b.y);
  if (dcmp(t) == 0) return false;
  double x = ((a * b) - (a.x - b.x) * lin.y) / t;
  cp = cpoint(x, lin.x * x + lin.y);
  return true;
}
double calc(pair<cpoint, cpoint> seg[], int m) {
  int ln = 0;
  double ans = 0;
  cpoint A, B, cp;
  for (int i = 0; i < (int)(m); ++i)
    lin[ln++] = getline(seg[i].first, seg[i].second);
  sort(lin, lin + ln);
  ln = unique(lin, lin + ln) - lin;
  for (int i = 0; i < (int)(ln); ++i) {
    vector<pair<double, int> > mark;
    for (int j = 0; j < (int)(n); ++j) {
      bool touch = 0;
      for (int k = 0; k < (int)(ply[j].n); ++k)
        if (lin[i] == getline(ply[j].cp[k], ply[j].cp[k + 1])) {
          touch = 1;
          break;
        }
      if (touch) continue;
      vector<cpoint> cut;
      for (int k = 0; k < (int)(ply[j].n); ++k) {
        A = ply[j].cp[k];
        B = ply[j].cp[k + 1];
        if (!getcut(lin[i], A, B, cp)) continue;
        if (dcmp((A - cp) ^ (B - cp)) <= 0) cut.push_back(cp);
      }
      sort(cut.begin(), cut.end());
      cut.resize(unique(cut.begin(), cut.end()) - cut.begin());
      if (((int)cut.size()) == 2) {
        mark.push_back(make_pair(cut[0].x, 0));
        mark.push_back(make_pair(cut[1].x, 1));
      }
    }
    for (int j = 0; j < (int)(m); ++j)
      if (lin[i] == getline(seg[j].first, seg[j].second)) {
        double mn = min(seg[j].first.x, seg[j].second.x);
        double mx = max(seg[j].first.x, seg[j].second.x);
        mark.push_back(make_pair(mn, 2));
        mark.push_back(make_pair(mx, 3));
      }
    sort(mark.begin(), mark.end());
    double last = mark[0].first;
    int in = 0, ct = 0;
    for (int j = 0; j < (int)(((int)mark.size())); ++j) {
      double y0 = lin[i].x * last + lin[i].y;
      double y1 = lin[i].x * mark[j].first + lin[i].y;
      if (!in && ct) ans += (y0 + y1) * (mark[j].first - last) / 2;
      last = mark[j].first;
      if (mark[j].second == 0) in++;
      if (mark[j].second == 1) in--;
      if (mark[j].second == 2) ct++;
      if (mark[j].second == 3) ct--;
    }
  }
  return ans;
}
double PolyUnion(poly ply[], int n) {
  int n1, n2, tot = n;
  n1 = n2 = 0;
  for (int i = 0; i < (int)(n); ++i)
    for (int j = 0; j < (int)(ply[i].n); ++j) {
      cpoint A = ply[i].cp[j];
      cpoint B = ply[i].cp[j + 1];
      if (dcmp(A.x - B.x) > 0) seg1[n1++] = make_pair(A, B);
      if (dcmp(A.x - B.x) < 0) seg2[n2++] = make_pair(A, B);
    }
  return calc(seg1, n1) - calc(seg2, n2);
}
void solve() {
  for (int i = 0; i < (int)(n); ++i) {
    ply[i].get();
    if (!ply[i].check()) --n, --i;
  }
  double area = PolyUnion(ply, n);
  double tot = 0;
  for (int i = 0; i < (int)(n); ++i)
    for (int j = 0; j < (int)(ply[i].n); ++j)
      tot += ply[i].cp[j] * ply[i].cp[j + 1];
  tot /= 2;
  printf("%.10f\n", tot / area);
}
void icpc() {
  while (~scanf("%d", &n)) {
    solve();
  }
}
}  // namespace acm
int main() {
  acm::icpc();
  return 0;
}