#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC target("avx")
#include <bits/stdc++.h>
#define sz(x) ((int)(x).size())
#define all(x) begin(x), end(x)
#define rep(i, l, r) for (int i = (l), i##end = (r); i <= i##end; ++i)
#define per(i, l, r) for (int i = (l), i##end = (r); i >= i##end; --i)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define log(...) (void(0))
#define endl '\n'
#endif
using namespace std;
using ll = long long;
using lf = long double;
using lll = __int128;
using ull = unsigned long long;
// using pt = pair<int, int>;
const int N = 2011;
struct pt {
  int x, y;
  int id;
  pt operator-(const pt &rhs) { return pt{x - rhs.x, y - rhs.y, id}; }
} a[N], seq[N], stk[N];
double sum[N];
ll cross(ll x1, ll y1, ll x2, ll y2) { return x1 * y2 - x2 * y1; }
ll cross(pt a, pt b) { return cross(a.x, a.y, b.x, b.y); }
double dist(pt a, pt b) { return sqrt(ll(a.x - b.x) * (a.x - b.x) + ll(a.y - b.y) * (a.y - b.y)); }
bool cmp(pt a, pt b) {
  bool sa = a.x > 0 || (a.x == 0 && b.y > 0), sb = b.x > 0 || (b.x == 0 && b.y > 0);
  if (sa != sb) return sa > sb;
  return cross(a.x, a.y, b.x, b.y) > 0;
}
double f[N][N], g[N][N];
// double fr[N][N], fl[N][N];
inline void umin(double &a, double t) {
  if (t < a) a = t;
}
inline void umax(double &a, double t) {
  if (t > a) a = t;
}
int main() {
#ifdef memset0
  freopen("F.in", "r", stdin);
#endif
  cin.tie(0)->sync_with_stdio(0);
  int n;
  cin >> n;
  // }
  for (int i = 1; i <= n; ++i) {
    cin >> a[i].x >> a[i].y;
    a[i].id = i;
  }
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++) {
      f[i][j] = f[j][i] = dist({0, 0, -1}, a[i]) + dist({0, 0, -1}, a[j]);
    }
  std::sort(a + 1, a + n + 1, cmp);
  // for (int i = 1; i <= n; ++i) log("(%d,%d)\n", a[i].x, a[i].y);
  for (int i = 1; i <= n; ++i) {
    // log("i=%d\n", i);
    int c = 0;
    for (int j = i; j <= n; ++j) seq[++c] = a[j];
    for (int j = 1; j < i; ++j) seq[++c] = a[j];
    int top = 0;
    for (int j = 1; j <= n; ++j) {
      if (cross(a[i], seq[j]) < 0) break;
      // log("j=%d(%d):", j, seq[j].id);
      while (top > 1 && cross(stk[top] - stk[top - 1], seq[j] - stk[top]) >= 0) --top;
      stk[++top] = seq[j], sum[top] = sum[top - 1];
      if (top > 1) sum[top] += dist(stk[top - 1], stk[top]);
      // for (int k = 1; k <= top; ++k) log("(%d,%d),", stk[k].x, stk[k].y);
      // log("\n");
      umin(f[a[i].id][seq[j].id], sum[top]);
    }
    reverse(seq + 2, seq + n + 1);
    // log("Rev:\n");
    top = 0;
    for (int j = 1; j <= n; ++j) {
      if (cross(a[i], seq[j]) > 0) break;
      // log("j=%d(%d):", j, seq[j].id);
      while (top > 1 && cross(stk[top] - stk[top - 1], seq[j] - stk[top]) <= 0) --top;
      stk[++top] = seq[j], sum[top] = sum[top - 1];
      if (top > 1) sum[top] += dist(stk[top - 1], stk[top]);
      // for (int k = 1; k <= top; ++k) log("(%d,%d),", stk[k].x, stk[k].y);
      // log("\n");
      umin(f[a[i].id][seq[j].id], sum[top]);
    }
  }
  // for (int i = 1; i <= n; ++i)
  //   for (int j = 1; j <= n; ++j) f[i][j] = min(fr[i][j], fl[i][j]), log("F[%d,%d]=%.3lf\n", i, j, f[i][j]);

  for (int i = 1; i <= n; ++i)
    for (int k = 1; k <= n; ++k)
      for (int j = i; j <= n; ++j) {
        umax(g[i][j], f[i][k] + f[k][j]);
      }

  for (int i = 1; i <= n; ++i)
    for (int j = 1; j < i; ++j) g[i][j] = g[j][i];
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      // log("G[%d,%d]=%.6lf\n", i, j, g[i][j]);
      g[i][j] += g[i - 1][j] + g[i][j - 1] - g[i - 1][j - 1];
    }
  int m;
  cin >> m;
  while (m--) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    double s = g[b][d] - g[a - 1][d] - g[b][c - 1] + g[a - 1][c - 1];
    printf("%.10lf\n", s / (b - a + 1) / (d - c + 1));
  }
  return 0;
}