#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define For(i,j,k) for(int i=(j);i<=(k);i++)
#define foR(i,j,k) for(int i=(j);i>=(k);i--) 
#define vi vector<int>
#define pb push_back
#define pii pair<int,int> 
#define mkp make_pair
#define SZ(x) ((int)x.size())
using namespace std;
inline int read() {
	char c;int res=0;bool flag=0;
	while(c=getchar(),c<48)(c=='-')&&(flag=1);
	do res=(res<<3)+(res<<1)+(c^48);
	while(c=getchar(),c>47);
	flag&&(res=-res); return res; 
}
int n,x[2003],y[2003],a[2003],s[2003],l,u,v,z,w,q;
double d[2003][2003],f[2003][2003],g[2003][2003];
bool cmp(int a,int b){
	return atan2(y[a],x[a])<atan2(y[b],x[b]);
}
signed main(){
	n=read();
	for(int i=1;i<=n;++i){
		x[i]=read(),y[i]=read();
		a[i]=i;
	}
	for(int i=1;i<=n;++i){
		for(int j=1;j<=n;++j){
			d[i][j]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
		}
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;++i){
		s[l=1]=a[i];
		double z=0;
		for(int j=i+1;j<=n;++j){
			if(x[a[j]]*y[a[i]]>x[a[i]]*y[a[j]])break;
			while(l>1){
				if((x[a[j]]-x[s[l]])*(y[a[j]]-y[s[l-1]])<=(x[a[j]]-x[s[l-1]])*(y[a[j]]-y[s[l]])){
					z-=d[s[l]][s[l-1]];
					--l;
				}
				else break;
			}
			s[++l]=a[j];
			z+=d[s[l]][s[l-1]];
			f[a[i]][s[l]]=z;
		}
		for(int j=1;j<i;++j){
			if(x[a[j]]*y[a[i]]>x[a[i]]*y[a[j]])break;
			while(l>1){
				if((x[a[j]]-x[s[l]])*(y[a[j]]-y[s[l-1]])<=(x[a[j]]-x[s[l-1]])*(y[a[j]]-y[s[l]])){
					z-=d[s[l]][s[l-1]];
					--l;
				}
				else break;
			}
			s[++l]=a[j];
			z+=d[s[l]][s[l-1]];
			f[a[i]][s[l]]=z;
		}
	}
	for(int i=1;i<=n;++i){
		for(int j=1;j<i;++j){
			f[i][j]=f[j][i]=max(f[i][j],f[j][i]);
		}
	}
	for(int i=1;i<=n;++i){
		for(int j=i;j<=n;++j){
			for(int k=1;k<=n;++k){
				(f[i][k]+f[k][j]>g[i][j])&&(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){
			g[i][j]+=g[i-1][j];
		}
	}
	for(int i=1;i<=n;++i){
		for(int j=1;j<=n;++j){
			g[i][j]+=g[i][j-1];
		}
	}
	q=read();
	while(q--){
		u=read()-1,v=read(),z=read()-1,w=read();
		printf("%.10lf\n",(g[v][w]+g[u][z]-g[v][z]-g[w][u])/(v-u)/(w-z));
	}
}