#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define N 2005
#define ll long long
struct Vec
{
	int x,y;
	Vec(int a=0,int b=0) {x=a,y=b;}
	double norm() {return sqrt(1LL*x*x+1LL*y*y);}
};
const double inf=1e100;
Vec operator + (const Vec &x,const Vec &y) {return Vec(x.x+y.x,x.y+y.y);}
Vec operator - (const Vec &x,const Vec &y) {return Vec(x.x-y.x,x.y-y.y);}
ll cross(const Vec &x,const Vec &y) {return 1LL*x.x*y.y-1LL*x.y*y.x;}
int sgn(ll x)
{
	if(x<0) return -1;
	else if(x>0) return 1;
	else return 0;
}
int ccw(const Vec &x,const Vec &y,const Vec &z) {return sgn(cross(y-x,z-x));}
Vec a[N];
Vec o(0,0);
int id[N];
int n,ok[N][N];
double dis[N][N],ans[N][N];
void solve(int l,int r)
{
	for(int i=l;i<=r;i++)
	{
		Vec premn=a[id[i%n]],u=a[id[i%n]];
		int lst=id[i%n];
		for(int j=i-1;j>=l;j--)
		{
			Vec v=a[id[j%n]];
			if(ccw(u,premn,v)==1)
			{
				dis[id[i%n]][id[j%n]]=dis[id[i%n]][lst]+dis[lst][id[j%n]];
				dis[id[j%n]][id[i%n]]=dis[id[i%n]][id[j%n]];
			}
			else
			{
				dis[id[i%n]][id[j%n]]=(u-v).norm();
				dis[id[j%n]][id[i%n]]=dis[id[i%n]][id[j%n]];
				premn=v,lst=id[j%n];
			}
		}
	}
}
signed main() {
#ifdef xay5421
	freopen("b.in","r",stdin);
#endif
	cin>>n;
	for(int i=0;i<n;i++) cin>>a[i].x>>a[i].y;
	for(int i=0;i<n;i++) id[i]=i;
	sort(id,id+n,[&](int x,int y){
		return atan2(a[x].y,a[x].x)<atan2(a[y].y,a[y].x);
	});
	// for(int i=0;i<n;i++) printf("%d %d\n",a[id[i]].x,a[id[i]].y);
	
	for(int i=0;i<n+n;i++)
	{
		Vec premn=a[id[i%n]],u=a[id[i%n]];
		int lst=id[i%n];
		for(int j=i-1;j>=0&&j>i-n;j--)
		{
			Vec v=a[id[j%n]];
			if(ccw(o,u,v)==1) break;
			if(ccw(u,premn,v)==1)
			{
				dis[id[i%n]][id[j%n]]=dis[id[i%n]][lst]+dis[lst][id[j%n]];
				dis[id[j%n]][id[i%n]]=dis[id[i%n]][id[j%n]];
			}
			else
			{
				dis[id[i%n]][id[j%n]]=(u-v).norm();
				dis[id[j%n]][id[i%n]]=dis[id[i%n]][id[j%n]];
				premn=v,lst=id[j%n];
			}
		}
	}
	
	// for(int i=0;i<n;i++) for(int j=0;j<n;j++) if(dis[i][j]==0) dis[i][j]=(a[i]-a[j]).norm();
	// for(int i=0;i<n;i++) for(int j=0;j<n;j++) printf("%2.2lf%c",dis[i][j]," \n"[j==n-1]);
	// cerr<<clock()<<endl;
	for(int i=0;i<n;i++) for(int j=i;j<n;j++)
	{
		for(int k=0;k<n;k++) ans[i+1][j+1]=max(ans[i+1][j+1],dis[i][k]+dis[j][k]);
		ans[j+1][i+1]=ans[i+1][j+1];
	}
	// cerr<<clock()<<endl;
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) ans[i][j]=ans[i][j]+ans[i-1][j]+ans[i][j-1]-ans[i-1][j-1];
	int Q; cin>>Q;
	while(Q--)
	{
		int l1,r1,l2,r2;
		scanf("%d %d %d %d",&l1,&r1,&l2,&r2);
		double sum=ans[r1][r2]-ans[l1-1][r2]-ans[r1][l2-1]+ans[l1-1][l2-1];
		printf("%.10lf\n",sum/(r1-l1+1)/(r2-l2+1));
	}
	
	return 0;
}